./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 133ba40f5b51c272364c51a4e246bcd97a40cd88b0bcd4bd92df8f8d6bb23a52 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:22:23,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:22:23,068 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:22:23,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:22:23,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:22:23,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:22:23,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:22:23,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:22:23,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:22:23,100 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:22:23,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:22:23,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:22:23,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:22:23,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:22:23,102 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:22:23,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:22:23,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:22:23,106 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:22:23,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:22:23,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:22:23,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:22:23,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:22:23,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:22:23,107 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:22:23,107 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:22:23,108 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:22:23,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:22:23,108 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:22:23,108 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:22:23,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:22:23,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:22:23,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:22:23,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:22:23,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:22:23,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:22:23,109 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:22:23,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:22:23,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:22:23,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:22:23,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:22:23,114 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:22:23,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:22:23,114 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 133ba40f5b51c272364c51a4e246bcd97a40cd88b0bcd4bd92df8f8d6bb23a52 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:22:23,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:22:23,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:22:23,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:22:23,445 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:22:23,445 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:22:23,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2024-09-25 10:22:24,903 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:22:25,077 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:22:25,078 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2024-09-25 10:22:25,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/301016e91/96fe13b211924490af991faa579b5c40/FLAGf393c7a0c [2024-09-25 10:22:25,464 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/301016e91/96fe13b211924490af991faa579b5c40 [2024-09-25 10:22:25,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:22:25,469 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:22:25,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:22:25,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:22:25,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:22:25,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:22:25" (1/1) ... [2024-09-25 10:22:25,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4050e13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:25, skipping insertion in model container [2024-09-25 10:22:25,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:22:25" (1/1) ... [2024-09-25 10:22:25,507 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:22:25,680 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2024-09-25 10:22:25,692 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2024-09-25 10:22:25,693 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2024-09-25 10:22:25,699 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2024-09-25 10:22:25,700 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2024-09-25 10:22:25,705 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2024-09-25 10:22:25,706 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2024-09-25 10:22:25,708 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2024-09-25 10:22:25,712 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2024-09-25 10:22:25,714 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2024-09-25 10:22:25,719 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2024-09-25 10:22:25,721 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2024-09-25 10:22:25,723 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2024-09-25 10:22:25,725 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2024-09-25 10:22:25,727 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2024-09-25 10:22:25,728 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2024-09-25 10:22:25,730 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2024-09-25 10:22:25,731 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2024-09-25 10:22:25,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:22:25,747 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:22:25,763 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2024-09-25 10:22:25,768 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2024-09-25 10:22:25,769 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2024-09-25 10:22:25,770 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2024-09-25 10:22:25,774 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2024-09-25 10:22:25,775 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2024-09-25 10:22:25,776 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2024-09-25 10:22:25,777 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2024-09-25 10:22:25,782 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2024-09-25 10:22:25,783 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2024-09-25 10:22:25,784 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2024-09-25 10:22:25,785 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2024-09-25 10:22:25,788 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2024-09-25 10:22:25,789 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2024-09-25 10:22:25,791 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2024-09-25 10:22:25,796 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2024-09-25 10:22:25,796 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2024-09-25 10:22:25,797 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2024-09-25 10:22:25,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:22:25,812 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:22:25,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:25 WrapperNode [2024-09-25 10:22:25,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:22:25,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:22:25,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:22:25,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:22:25,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:25" (1/1) ... [2024-09-25 10:22:25,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:25" (1/1) ... [2024-09-25 10:22:25,829 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:22:25,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:22:25,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:22:25,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:22:25,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:22:25,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:25" (1/1) ... [2024-09-25 10:22:25,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:25" (1/1) ... [2024-09-25 10:22:25,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:25" (1/1) ... [2024-09-25 10:22:25,873 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 10:22:25,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:25" (1/1) ... [2024-09-25 10:22:25,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:25" (1/1) ... [2024-09-25 10:22:25,884 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:25" (1/1) ... [2024-09-25 10:22:25,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:25" (1/1) ... [2024-09-25 10:22:25,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:25" (1/1) ... [2024-09-25 10:22:25,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:25" (1/1) ... [2024-09-25 10:22:25,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:22:25,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:22:25,902 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:22:25,902 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:22:25,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:25" (1/1) ... [2024-09-25 10:22:25,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:22:25,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:22:25,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 10:22:25,953 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 10:22:25,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:22:25,994 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:22:25,994 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:22:25,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:22:25,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:22:25,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:22:25,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:22:25,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:22:26,066 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:22:26,068 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:22:26,368 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2024-09-25 10:22:26,368 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:22:26,393 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:22:26,393 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 10:22:26,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:22:26 BoogieIcfgContainer [2024-09-25 10:22:26,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:22:26,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:22:26,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:22:26,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:22:26,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:22:25" (1/3) ... [2024-09-25 10:22:26,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac4e690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:22:26, skipping insertion in model container [2024-09-25 10:22:26,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:25" (2/3) ... [2024-09-25 10:22:26,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac4e690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:22:26, skipping insertion in model container [2024-09-25 10:22:26,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:22:26" (3/3) ... [2024-09-25 10:22:26,404 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2024-09-25 10:22:26,416 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:22:26,417 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-09-25 10:22:26,461 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:22:26,467 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6f832ca7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:22:26,467 INFO L337 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-09-25 10:22:26,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 74 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:22:26,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 10:22:26,476 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:26,476 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:26,477 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:26,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:26,481 INFO L85 PathProgramCache]: Analyzing trace with hash 315066952, now seen corresponding path program 1 times [2024-09-25 10:22:26,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:26,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69288082] [2024-09-25 10:22:26,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:26,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:26,828 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:26,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:26,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:26,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69288082] [2024-09-25 10:22:26,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69288082] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:26,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:26,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:22:26,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296114910] [2024-09-25 10:22:26,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:26,841 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:22:26,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:26,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:22:26,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:22:26,860 INFO L87 Difference]: Start difference. First operand has 79 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 74 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:27,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:27,063 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2024-09-25 10:22:27,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:22:27,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-25 10:22:27,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:27,073 INFO L225 Difference]: With dead ends: 89 [2024-09-25 10:22:27,073 INFO L226 Difference]: Without dead ends: 74 [2024-09-25 10:22:27,075 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:27,080 INFO L434 NwaCegarLoop]: 70 mSDtfsCounter, 24 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:27,081 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 187 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:27,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-09-25 10:22:27,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2024-09-25 10:22:27,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 68 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:27,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-09-25 10:22:27,116 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 11 [2024-09-25 10:22:27,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:27,118 INFO L474 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-09-25 10:22:27,118 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:27,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-09-25 10:22:27,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 10:22:27,120 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:27,120 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:27,120 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:22:27,120 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:27,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:27,121 INFO L85 PathProgramCache]: Analyzing trace with hash 311896200, now seen corresponding path program 1 times [2024-09-25 10:22:27,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:27,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511865533] [2024-09-25 10:22:27,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:27,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:27,221 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:27,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:27,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:27,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511865533] [2024-09-25 10:22:27,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511865533] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:27,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:27,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:22:27,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309341856] [2024-09-25 10:22:27,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:27,230 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:22:27,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:27,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:22:27,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:22:27,232 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:27,363 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2024-09-25 10:22:27,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:22:27,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-25 10:22:27,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:27,364 INFO L225 Difference]: With dead ends: 74 [2024-09-25 10:22:27,365 INFO L226 Difference]: Without dead ends: 72 [2024-09-25 10:22:27,365 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:27,366 INFO L434 NwaCegarLoop]: 62 mSDtfsCounter, 12 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:27,366 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 166 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:27,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-09-25 10:22:27,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2024-09-25 10:22:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.392156862745098) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2024-09-25 10:22:27,374 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 11 [2024-09-25 10:22:27,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:27,374 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2024-09-25 10:22:27,375 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:27,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:27,375 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2024-09-25 10:22:27,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-25 10:22:27,376 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:27,376 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:27,376 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:22:27,376 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:27,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:27,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1659047165, now seen corresponding path program 1 times [2024-09-25 10:22:27,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:27,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541879725] [2024-09-25 10:22:27,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:27,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:27,440 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:27,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:27,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541879725] [2024-09-25 10:22:27,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541879725] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:27,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:27,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:22:27,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914989675] [2024-09-25 10:22:27,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:27,446 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:27,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:27,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:27,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:27,447 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:27,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:27,567 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2024-09-25 10:22:27,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:22:27,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-25 10:22:27,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:27,569 INFO L225 Difference]: With dead ends: 72 [2024-09-25 10:22:27,569 INFO L226 Difference]: Without dead ends: 70 [2024-09-25 10:22:27,569 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:22:27,570 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 53 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:27,570 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 129 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:27,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-25 10:22:27,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-09-25 10:22:27,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.38) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:27,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-09-25 10:22:27,580 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 14 [2024-09-25 10:22:27,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:27,580 INFO L474 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-09-25 10:22:27,580 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:27,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:27,581 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-09-25 10:22:27,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-25 10:22:27,581 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:27,582 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:27,582 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 10:22:27,582 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:27,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:27,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1688353559, now seen corresponding path program 1 times [2024-09-25 10:22:27,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:27,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911433068] [2024-09-25 10:22:27,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:27,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:27,640 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:27,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:27,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911433068] [2024-09-25 10:22:27,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911433068] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:27,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:27,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:22:27,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749041668] [2024-09-25 10:22:27,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:27,645 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:27,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:27,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:27,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:27,647 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:27,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:27,763 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2024-09-25 10:22:27,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:22:27,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-25 10:22:27,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:27,767 INFO L225 Difference]: With dead ends: 70 [2024-09-25 10:22:27,767 INFO L226 Difference]: Without dead ends: 68 [2024-09-25 10:22:27,768 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:22:27,768 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 51 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:27,769 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 123 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:27,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-25 10:22:27,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-09-25 10:22:27,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:27,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2024-09-25 10:22:27,775 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 14 [2024-09-25 10:22:27,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:27,775 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2024-09-25 10:22:27,775 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:27,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:27,776 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2024-09-25 10:22:27,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-25 10:22:27,776 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:27,776 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:27,776 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-25 10:22:27,776 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:27,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:27,776 INFO L85 PathProgramCache]: Analyzing trace with hash -108700357, now seen corresponding path program 1 times [2024-09-25 10:22:27,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:27,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147134198] [2024-09-25 10:22:27,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:27,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:27,842 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:27,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:27,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:27,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147134198] [2024-09-25 10:22:27,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147134198] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:27,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:27,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:22:27,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178808061] [2024-09-25 10:22:27,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:27,846 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:27,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:27,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:27,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:27,847 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:27,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:27,952 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2024-09-25 10:22:27,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:22:27,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-25 10:22:27,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:27,953 INFO L225 Difference]: With dead ends: 68 [2024-09-25 10:22:27,953 INFO L226 Difference]: Without dead ends: 66 [2024-09-25 10:22:27,954 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:22:27,954 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 48 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:27,955 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 117 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:27,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-25 10:22:27,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-09-25 10:22:27,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 60 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:27,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2024-09-25 10:22:27,960 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 15 [2024-09-25 10:22:27,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:27,961 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2024-09-25 10:22:27,961 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:27,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:27,961 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2024-09-25 10:22:27,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-25 10:22:27,961 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:27,962 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:27,962 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-25 10:22:27,962 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:27,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:27,962 INFO L85 PathProgramCache]: Analyzing trace with hash -108714259, now seen corresponding path program 1 times [2024-09-25 10:22:27,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:27,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765158319] [2024-09-25 10:22:27,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:27,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:28,007 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:28,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:28,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:28,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765158319] [2024-09-25 10:22:28,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765158319] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:28,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:28,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:22:28,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345739638] [2024-09-25 10:22:28,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:28,011 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:28,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:28,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:28,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:28,011 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:28,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:28,112 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2024-09-25 10:22:28,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:22:28,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-25 10:22:28,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:28,113 INFO L225 Difference]: With dead ends: 66 [2024-09-25 10:22:28,113 INFO L226 Difference]: Without dead ends: 64 [2024-09-25 10:22:28,113 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:22:28,114 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 46 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:28,114 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 111 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-25 10:22:28,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-09-25 10:22:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 58 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2024-09-25 10:22:28,120 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 15 [2024-09-25 10:22:28,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:28,120 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2024-09-25 10:22:28,120 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:28,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2024-09-25 10:22:28,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-25 10:22:28,121 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:28,121 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:28,121 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-25 10:22:28,121 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:28,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:28,122 INFO L85 PathProgramCache]: Analyzing trace with hash -109142256, now seen corresponding path program 1 times [2024-09-25 10:22:28,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:28,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192132545] [2024-09-25 10:22:28,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:28,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:28,160 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:28,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:28,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:28,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192132545] [2024-09-25 10:22:28,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192132545] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:28,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:28,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:22:28,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117830820] [2024-09-25 10:22:28,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:28,164 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:22:28,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:28,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:22:28,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:22:28,165 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:28,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:28,248 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2024-09-25 10:22:28,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:22:28,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-25 10:22:28,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:28,249 INFO L225 Difference]: With dead ends: 64 [2024-09-25 10:22:28,249 INFO L226 Difference]: Without dead ends: 60 [2024-09-25 10:22:28,249 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:28,249 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 16 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:28,250 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 128 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:28,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-25 10:22:28,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-09-25 10:22:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2024-09-25 10:22:28,255 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 15 [2024-09-25 10:22:28,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:28,256 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2024-09-25 10:22:28,256 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:28,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2024-09-25 10:22:28,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-25 10:22:28,256 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:28,256 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:28,257 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-25 10:22:28,257 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:28,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:28,257 INFO L85 PathProgramCache]: Analyzing trace with hash 799355856, now seen corresponding path program 1 times [2024-09-25 10:22:28,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:28,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843210594] [2024-09-25 10:22:28,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:28,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:28,308 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:28,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:28,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:28,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843210594] [2024-09-25 10:22:28,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843210594] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:28,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:28,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:22:28,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340505374] [2024-09-25 10:22:28,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:28,312 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:22:28,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:28,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:22:28,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:22:28,313 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:28,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:28,386 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2024-09-25 10:22:28,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:22:28,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-25 10:22:28,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:28,387 INFO L225 Difference]: With dead ends: 60 [2024-09-25 10:22:28,387 INFO L226 Difference]: Without dead ends: 56 [2024-09-25 10:22:28,388 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:28,388 INFO L434 NwaCegarLoop]: 46 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:28,388 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 120 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:28,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-25 10:22:28,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2024-09-25 10:22:28,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:28,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-09-25 10:22:28,394 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2024-09-25 10:22:28,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:28,394 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-09-25 10:22:28,394 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:28,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:28,394 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-09-25 10:22:28,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:22:28,395 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:28,395 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:28,395 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-25 10:22:28,395 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:28,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:28,395 INFO L85 PathProgramCache]: Analyzing trace with hash 925259441, now seen corresponding path program 1 times [2024-09-25 10:22:28,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:28,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180106213] [2024-09-25 10:22:28,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:28,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:28,477 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:28,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:28,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180106213] [2024-09-25 10:22:28,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180106213] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:28,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:28,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:22:28,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340301431] [2024-09-25 10:22:28,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:28,481 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:22:28,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:28,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:22:28,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:28,481 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:28,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:28,602 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2024-09-25 10:22:28,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:22:28,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-25 10:22:28,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:28,604 INFO L225 Difference]: With dead ends: 88 [2024-09-25 10:22:28,604 INFO L226 Difference]: Without dead ends: 86 [2024-09-25 10:22:28,604 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-25 10:22:28,605 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 40 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:28,605 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 119 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:28,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-09-25 10:22:28,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 59. [2024-09-25 10:22:28,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.326086956521739) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:28,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-09-25 10:22:28,613 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 16 [2024-09-25 10:22:28,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:28,613 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-09-25 10:22:28,613 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:28,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:28,614 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-09-25 10:22:28,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:22:28,614 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:28,614 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:28,615 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-25 10:22:28,615 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:28,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:28,615 INFO L85 PathProgramCache]: Analyzing trace with hash 924828465, now seen corresponding path program 1 times [2024-09-25 10:22:28,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:28,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753181655] [2024-09-25 10:22:28,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:28,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:28,695 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:28,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:28,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753181655] [2024-09-25 10:22:28,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753181655] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:28,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:28,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:22:28,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897214483] [2024-09-25 10:22:28,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:28,699 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:22:28,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:28,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:22:28,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:28,700 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:28,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:28,836 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2024-09-25 10:22:28,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:22:28,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-25 10:22:28,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:28,837 INFO L225 Difference]: With dead ends: 86 [2024-09-25 10:22:28,837 INFO L226 Difference]: Without dead ends: 84 [2024-09-25 10:22:28,837 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-25 10:22:28,838 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 35 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:28,838 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 147 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:28,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-25 10:22:28,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 61. [2024-09-25 10:22:28,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.3125) internal successors, (63), 57 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:28,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-09-25 10:22:28,846 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 16 [2024-09-25 10:22:28,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:28,846 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-09-25 10:22:28,846 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:28,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:28,846 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-09-25 10:22:28,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:22:28,847 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:28,847 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:28,847 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-25 10:22:28,847 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:28,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:28,848 INFO L85 PathProgramCache]: Analyzing trace with hash -975549911, now seen corresponding path program 1 times [2024-09-25 10:22:28,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:28,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587426225] [2024-09-25 10:22:28,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:28,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:28,887 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:28,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:28,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:28,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587426225] [2024-09-25 10:22:28,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587426225] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:28,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:28,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:22:28,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772353331] [2024-09-25 10:22:28,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:28,891 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:28,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:28,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:28,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:28,891 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:28,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:28,983 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2024-09-25 10:22:28,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:22:28,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-25 10:22:28,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:28,984 INFO L225 Difference]: With dead ends: 62 [2024-09-25 10:22:28,984 INFO L226 Difference]: Without dead ends: 60 [2024-09-25 10:22:28,985 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:22:28,985 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:28,985 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 89 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:28,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-25 10:22:28,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2024-09-25 10:22:28,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.297872340425532) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:28,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-09-25 10:22:28,993 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 16 [2024-09-25 10:22:28,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:28,993 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-09-25 10:22:28,993 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:28,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:28,993 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-09-25 10:22:28,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:22:28,994 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:28,994 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:28,994 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-25 10:22:28,994 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:28,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:28,995 INFO L85 PathProgramCache]: Analyzing trace with hash -974010711, now seen corresponding path program 1 times [2024-09-25 10:22:28,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:28,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833698892] [2024-09-25 10:22:28,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:28,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:29,034 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:29,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:29,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:29,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833698892] [2024-09-25 10:22:29,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833698892] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:29,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:29,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:22:29,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587974123] [2024-09-25 10:22:29,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:29,037 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:29,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:29,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:29,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:29,038 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:29,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:29,128 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2024-09-25 10:22:29,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:22:29,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-25 10:22:29,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:29,129 INFO L225 Difference]: With dead ends: 60 [2024-09-25 10:22:29,129 INFO L226 Difference]: Without dead ends: 58 [2024-09-25 10:22:29,129 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:22:29,129 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 39 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:29,130 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 83 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:29,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-25 10:22:29,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2024-09-25 10:22:29,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:29,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2024-09-25 10:22:29,136 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 16 [2024-09-25 10:22:29,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:29,137 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2024-09-25 10:22:29,137 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:29,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:29,137 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2024-09-25 10:22:29,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-25 10:22:29,137 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:29,138 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:29,138 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-25 10:22:29,138 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:29,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:29,138 INFO L85 PathProgramCache]: Analyzing trace with hash -175907649, now seen corresponding path program 1 times [2024-09-25 10:22:29,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:29,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773009453] [2024-09-25 10:22:29,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:29,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:29,188 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:29,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:29,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:29,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773009453] [2024-09-25 10:22:29,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773009453] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:29,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:29,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:22:29,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195830287] [2024-09-25 10:22:29,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:29,192 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:29,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:29,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:29,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:29,193 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:29,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:29,291 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-09-25 10:22:29,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:22:29,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-25 10:22:29,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:29,292 INFO L225 Difference]: With dead ends: 58 [2024-09-25 10:22:29,293 INFO L226 Difference]: Without dead ends: 56 [2024-09-25 10:22:29,293 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:22:29,293 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:29,294 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 77 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:29,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-25 10:22:29,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-09-25 10:22:29,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:29,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2024-09-25 10:22:29,303 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 17 [2024-09-25 10:22:29,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:29,303 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2024-09-25 10:22:29,303 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:29,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:29,304 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2024-09-25 10:22:29,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-25 10:22:29,304 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:29,304 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:29,304 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-25 10:22:29,305 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:29,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:29,305 INFO L85 PathProgramCache]: Analyzing trace with hash -177273069, now seen corresponding path program 1 times [2024-09-25 10:22:29,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:29,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411555508] [2024-09-25 10:22:29,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:29,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:29,381 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:29,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:29,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411555508] [2024-09-25 10:22:29,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411555508] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:29,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:29,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:22:29,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758393326] [2024-09-25 10:22:29,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:29,385 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:22:29,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:29,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:22:29,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:29,386 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:29,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:29,490 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2024-09-25 10:22:29,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:22:29,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-25 10:22:29,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:29,491 INFO L225 Difference]: With dead ends: 72 [2024-09-25 10:22:29,491 INFO L226 Difference]: Without dead ends: 70 [2024-09-25 10:22:29,491 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-25 10:22:29,491 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:29,492 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 98 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:29,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-25 10:22:29,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2024-09-25 10:22:29,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-09-25 10:22:29,498 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 17 [2024-09-25 10:22:29,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:29,498 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-09-25 10:22:29,498 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:29,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-09-25 10:22:29,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-25 10:22:29,498 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:29,498 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:29,499 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-25 10:22:29,499 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:29,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:29,499 INFO L85 PathProgramCache]: Analyzing trace with hash -129557819, now seen corresponding path program 1 times [2024-09-25 10:22:29,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:29,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560604458] [2024-09-25 10:22:29,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:29,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:29,566 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:29,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:29,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560604458] [2024-09-25 10:22:29,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560604458] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:29,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:29,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:22:29,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889235563] [2024-09-25 10:22:29,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:29,569 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:22:29,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:29,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:22:29,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:29,570 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:29,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:29,676 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-09-25 10:22:29,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:22:29,676 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-25 10:22:29,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:29,677 INFO L225 Difference]: With dead ends: 73 [2024-09-25 10:22:29,677 INFO L226 Difference]: Without dead ends: 69 [2024-09-25 10:22:29,677 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:22:29,678 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:29,678 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 121 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:29,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-25 10:22:29,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2024-09-25 10:22:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:29,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-09-25 10:22:29,697 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 17 [2024-09-25 10:22:29,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:29,697 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-09-25 10:22:29,697 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:29,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:29,697 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-09-25 10:22:29,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-25 10:22:29,698 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:29,698 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:29,698 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-25 10:22:29,698 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:29,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:29,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1158166692, now seen corresponding path program 1 times [2024-09-25 10:22:29,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:29,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75915218] [2024-09-25 10:22:29,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:29,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:29,865 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:29,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:29,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75915218] [2024-09-25 10:22:29,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75915218] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:29,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:29,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:22:29,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605600304] [2024-09-25 10:22:29,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:29,868 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:22:29,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:29,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:22:29,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:29,873 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:30,006 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2024-09-25 10:22:30,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:22:30,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-25 10:22:30,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:30,009 INFO L225 Difference]: With dead ends: 69 [2024-09-25 10:22:30,009 INFO L226 Difference]: Without dead ends: 67 [2024-09-25 10:22:30,009 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-25 10:22:30,010 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 28 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:30,010 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 102 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:30,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-25 10:22:30,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2024-09-25 10:22:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 61 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:30,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2024-09-25 10:22:30,029 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 18 [2024-09-25 10:22:30,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:30,029 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2024-09-25 10:22:30,029 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:30,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:30,030 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2024-09-25 10:22:30,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-25 10:22:30,030 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:30,030 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:30,030 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-25 10:22:30,030 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:30,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:30,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1439368950, now seen corresponding path program 1 times [2024-09-25 10:22:30,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:30,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333961208] [2024-09-25 10:22:30,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:30,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:30,104 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:30,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:30,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333961208] [2024-09-25 10:22:30,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333961208] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:30,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:30,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:22:30,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610633180] [2024-09-25 10:22:30,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:30,107 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:22:30,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:30,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:22:30,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:22:30,110 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:30,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:30,213 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2024-09-25 10:22:30,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:22:30,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-09-25 10:22:30,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:30,215 INFO L225 Difference]: With dead ends: 65 [2024-09-25 10:22:30,215 INFO L226 Difference]: Without dead ends: 63 [2024-09-25 10:22:30,215 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:30,215 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:30,216 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 68 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:30,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-25 10:22:30,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-09-25 10:22:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 59 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2024-09-25 10:22:30,222 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 19 [2024-09-25 10:22:30,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:30,222 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2024-09-25 10:22:30,222 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:30,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2024-09-25 10:22:30,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-25 10:22:30,224 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:30,224 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:30,224 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-25 10:22:30,224 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:30,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:30,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1670767605, now seen corresponding path program 1 times [2024-09-25 10:22:30,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:30,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46859015] [2024-09-25 10:22:30,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:30,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:30,270 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:30,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:30,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:30,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46859015] [2024-09-25 10:22:30,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46859015] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:30,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:30,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:22:30,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158130910] [2024-09-25 10:22:30,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:30,273 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:22:30,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:30,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:22:30,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:22:30,274 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:30,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:30,350 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2024-09-25 10:22:30,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:22:30,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-09-25 10:22:30,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:30,351 INFO L225 Difference]: With dead ends: 63 [2024-09-25 10:22:30,351 INFO L226 Difference]: Without dead ends: 59 [2024-09-25 10:22:30,352 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:30,352 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:30,352 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 90 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:30,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-25 10:22:30,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-09-25 10:22:30,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 55 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2024-09-25 10:22:30,378 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 20 [2024-09-25 10:22:30,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:30,379 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2024-09-25 10:22:30,379 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:30,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:30,379 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2024-09-25 10:22:30,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 10:22:30,379 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:30,380 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:30,380 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-25 10:22:30,380 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:30,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:30,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1687468520, now seen corresponding path program 1 times [2024-09-25 10:22:30,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:30,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591305903] [2024-09-25 10:22:30,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:30,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:30,479 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:30,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:30,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:30,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591305903] [2024-09-25 10:22:30,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591305903] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:22:30,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149370741] [2024-09-25 10:22:30,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:30,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:22:30,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:22:30,484 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:22:30,485 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 10:22:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:30,536 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-25 10:22:30,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:22:30,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:30,712 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:22:30,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:22:30,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149370741] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:22:30,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:22:30,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 18 [2024-09-25 10:22:30,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368730855] [2024-09-25 10:22:30,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:22:30,787 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-25 10:22:30,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:30,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-25 10:22:30,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-09-25 10:22:30,787 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:31,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:31,007 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2024-09-25 10:22:31,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-25 10:22:31,007 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-25 10:22:31,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:31,008 INFO L225 Difference]: With dead ends: 86 [2024-09-25 10:22:31,008 INFO L226 Difference]: Without dead ends: 84 [2024-09-25 10:22:31,008 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2024-09-25 10:22:31,009 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 324 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:31,009 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 139 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-25 10:22:31,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 55. [2024-09-25 10:22:31,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:31,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2024-09-25 10:22:31,016 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 21 [2024-09-25 10:22:31,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:31,016 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2024-09-25 10:22:31,016 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:31,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:31,016 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2024-09-25 10:22:31,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 10:22:31,017 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:31,017 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:31,030 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 10:22:31,217 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:22:31,218 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:31,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:31,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1687899496, now seen corresponding path program 1 times [2024-09-25 10:22:31,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:31,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034251384] [2024-09-25 10:22:31,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:31,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:31,302 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:31,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:31,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:31,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034251384] [2024-09-25 10:22:31,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034251384] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:22:31,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457980633] [2024-09-25 10:22:31,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:31,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:22:31,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:22:31,306 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:22:31,310 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 10:22:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:31,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-25 10:22:31,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:22:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:31,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:22:31,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:22:31,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457980633] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:22:31,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:22:31,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 18 [2024-09-25 10:22:31,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796583410] [2024-09-25 10:22:31,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:22:31,537 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-25 10:22:31,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:31,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-25 10:22:31,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-09-25 10:22:31,537 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:31,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:31,723 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2024-09-25 10:22:31,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-25 10:22:31,723 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-25 10:22:31,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:31,724 INFO L225 Difference]: With dead ends: 82 [2024-09-25 10:22:31,724 INFO L226 Difference]: Without dead ends: 80 [2024-09-25 10:22:31,724 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2024-09-25 10:22:31,724 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 113 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:31,724 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 96 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:31,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-25 10:22:31,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 48. [2024-09-25 10:22:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:31,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-09-25 10:22:31,732 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 21 [2024-09-25 10:22:31,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:31,732 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-09-25 10:22:31,732 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:31,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-09-25 10:22:31,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 10:22:31,733 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:31,733 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:31,745 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 10:22:31,933 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:22:31,933 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:31,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:31,934 INFO L85 PathProgramCache]: Analyzing trace with hash 267428458, now seen corresponding path program 1 times [2024-09-25 10:22:31,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:31,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952741775] [2024-09-25 10:22:31,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:31,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:32,008 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:32,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:32,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952741775] [2024-09-25 10:22:32,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952741775] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:32,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:32,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:22:32,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780513604] [2024-09-25 10:22:32,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:32,012 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:22:32,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:32,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:22:32,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:32,013 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:32,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:32,104 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2024-09-25 10:22:32,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:22:32,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-25 10:22:32,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:32,105 INFO L225 Difference]: With dead ends: 48 [2024-09-25 10:22:32,105 INFO L226 Difference]: Without dead ends: 46 [2024-09-25 10:22:32,105 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:22:32,106 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 74 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:32,106 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 37 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:32,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-25 10:22:32,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2024-09-25 10:22:32,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 39 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:32,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-09-25 10:22:32,116 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 21 [2024-09-25 10:22:32,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:32,116 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-09-25 10:22:32,116 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:32,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:32,116 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-09-25 10:22:32,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 10:22:32,116 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:32,117 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:32,117 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-09-25 10:22:32,117 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:32,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:32,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1335654093, now seen corresponding path program 1 times [2024-09-25 10:22:32,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:32,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194264908] [2024-09-25 10:22:32,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:32,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:32,188 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:32,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:32,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:32,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194264908] [2024-09-25 10:22:32,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194264908] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:32,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:32,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-25 10:22:32,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283005160] [2024-09-25 10:22:32,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:32,191 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 10:22:32,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:32,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 10:22:32,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:22:32,192 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:32,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:32,269 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-09-25 10:22:32,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:22:32,269 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-09-25 10:22:32,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:32,270 INFO L225 Difference]: With dead ends: 43 [2024-09-25 10:22:32,270 INFO L226 Difference]: Without dead ends: 41 [2024-09-25 10:22:32,270 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:22:32,270 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:32,271 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 43 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:32,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-25 10:22:32,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-09-25 10:22:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:32,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-09-25 10:22:32,276 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 22 [2024-09-25 10:22:32,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:32,276 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-09-25 10:22:32,276 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:32,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:32,277 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-09-25 10:22:32,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 10:22:32,277 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:32,277 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:32,277 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-09-25 10:22:32,277 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2024-09-25 10:22:32,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:32,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1287938843, now seen corresponding path program 1 times [2024-09-25 10:22:32,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:32,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523152758] [2024-09-25 10:22:32,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:32,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:32,341 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:32,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:32,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:32,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523152758] [2024-09-25 10:22:32,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523152758] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:32,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:32,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-25 10:22:32,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725953622] [2024-09-25 10:22:32,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:32,344 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 10:22:32,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:32,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 10:22:32,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:22:32,344 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:32,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:32,415 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-09-25 10:22:32,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:22:32,415 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-09-25 10:22:32,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:32,416 INFO L225 Difference]: With dead ends: 38 [2024-09-25 10:22:32,416 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 10:22:32,416 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-25 10:22:32,417 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:32,417 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 31 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:22:32,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 10:22:32,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 10:22:32,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-25 10:22:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 10:22:32,417 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2024-09-25 10:22:32,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:32,418 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 10:22:32,418 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:32,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:32,418 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 10:22:32,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 10:22:32,420 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2024-09-25 10:22:32,420 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2024-09-25 10:22:32,420 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2024-09-25 10:22:32,420 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2024-09-25 10:22:32,421 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2024-09-25 10:22:32,421 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2024-09-25 10:22:32,421 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2024-09-25 10:22:32,421 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2024-09-25 10:22:32,421 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2024-09-25 10:22:32,421 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2024-09-25 10:22:32,421 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2024-09-25 10:22:32,421 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2024-09-25 10:22:32,421 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2024-09-25 10:22:32,421 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2024-09-25 10:22:32,422 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2024-09-25 10:22:32,422 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2024-09-25 10:22:32,422 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2024-09-25 10:22:32,422 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2024-09-25 10:22:32,422 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-09-25 10:22:32,424 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:32,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 10:22:33,837 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 10:22:33,862 WARN L156 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) Eliminated clause: true [2024-09-25 10:22:33,864 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:22:33,865 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:22:33,865 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:22:33,865 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:22:33,865 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:22:33,865 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:22:33,865 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:22:33,865 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:22:33,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 10:22:33 BoogieIcfgContainer [2024-09-25 10:22:33,866 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 10:22:33,866 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 10:22:33,866 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 10:22:33,866 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 10:22:33,867 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:22:26" (3/4) ... [2024-09-25 10:22:33,868 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 10:22:33,905 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 10:22:33,905 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 10:22:33,905 INFO L158 Benchmark]: Toolchain (without parser) took 8436.76ms. Allocated memory was 109.1MB in the beginning and 293.6MB in the end (delta: 184.5MB). Free memory was 75.1MB in the beginning and 131.5MB in the end (delta: -56.4MB). Peak memory consumption was 130.2MB. Max. memory is 16.1GB. [2024-09-25 10:22:33,905 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 54.5MB. Free memory was 30.9MB in the beginning and 30.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:22:33,906 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.96ms. Allocated memory is still 109.1MB. Free memory was 74.8MB in the beginning and 56.2MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-09-25 10:22:33,906 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.74ms. Allocated memory is still 109.1MB. Free memory was 56.2MB in the beginning and 55.4MB in the end (delta: 857.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:22:33,906 INFO L158 Benchmark]: Boogie Preprocessor took 71.06ms. Allocated memory is still 109.1MB. Free memory was 55.4MB in the beginning and 86.9MB in the end (delta: -31.5MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2024-09-25 10:22:33,906 INFO L158 Benchmark]: RCFGBuilder took 492.21ms. Allocated memory is still 109.1MB. Free memory was 86.9MB in the beginning and 67.3MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-09-25 10:22:33,906 INFO L158 Benchmark]: TraceAbstraction took 7468.57ms. Allocated memory was 109.1MB in the beginning and 293.6MB in the end (delta: 184.5MB). Free memory was 66.9MB in the beginning and 134.6MB in the end (delta: -67.7MB). Peak memory consumption was 160.3MB. Max. memory is 16.1GB. [2024-09-25 10:22:33,907 INFO L158 Benchmark]: Witness Printer took 38.75ms. Allocated memory is still 293.6MB. Free memory was 133.6MB in the beginning and 131.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:22:33,907 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 54.5MB. Free memory was 30.9MB in the beginning and 30.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.96ms. Allocated memory is still 109.1MB. Free memory was 74.8MB in the beginning and 56.2MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 15.74ms. Allocated memory is still 109.1MB. Free memory was 56.2MB in the beginning and 55.4MB in the end (delta: 857.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.06ms. Allocated memory is still 109.1MB. Free memory was 55.4MB in the beginning and 86.9MB in the end (delta: -31.5MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * RCFGBuilder took 492.21ms. Allocated memory is still 109.1MB. Free memory was 86.9MB in the beginning and 67.3MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7468.57ms. Allocated memory was 109.1MB in the beginning and 293.6MB in the end (delta: 184.5MB). Free memory was 66.9MB in the beginning and 134.6MB in the end (delta: -67.7MB). Peak memory consumption was 160.3MB. Max. memory is 16.1GB. * Witness Printer took 38.75ms. Allocated memory is still 293.6MB. Free memory was 133.6MB in the beginning and 131.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 52]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 72]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 84]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 114]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 126]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 142]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 154]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 176]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 188]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 224]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 236]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 278]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 297]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 309]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 333]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 345]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 366]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 378]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1154 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1154 mSDsluCounter, 2421 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1705 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3234 IncrementalHoareTripleChecker+Invalid, 3392 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 716 mSDtfsCounter, 3234 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 138 SyntacticMatches, 6 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=0, InterpolantAutomatonStates: 181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 154 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 431 NumberOfCodeBlocks, 431 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 446 ConstructedInterpolants, 0 QuantifiedInterpolants, 1855 SizeOfPredicates, 6 NumberOfNonLiveVariables, 259 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 282]: Location Invariant Derived location invariant: (((main__t == 0) || (1 <= main__t)) && (((long long) main__t + 1) <= main__tagbuf_len)) - InvariantResult [Line: 63]: Location Invariant Derived location invariant: ((1 <= main__t) && (main__t <= main__tagbuf_len)) - InvariantResult [Line: 32]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 32]: Location Invariant Derived location invariant: ((((long long) main__t + 1) <= main__tagbuf_len) && ((0 < main__t) || (main__t == 0))) - InvariantResult [Line: 101]: Location Invariant Derived location invariant: ((((long long) main__t + 1) <= main__tagbuf_len) && (1 <= main__t)) - ProcedureContractResult [Line: 15]: Procedure Contract for main Derived contract for procedure main. Ensures: (__return_main == \old(__return_main)) RESULT: Ultimate proved your program to be correct! [2024-09-25 10:22:33,931 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE