./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4b8d677-308d-40a9-b239-0a125fd9b5db/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4b8d677-308d-40a9-b239-0a125fd9b5db/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4b8d677-308d-40a9-b239-0a125fd9b5db/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4b8d677-308d-40a9-b239-0a125fd9b5db/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4b8d677-308d-40a9-b239-0a125fd9b5db/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4b8d677-308d-40a9-b239-0a125fd9b5db/bin/uautomizer-verify-jihMAELWvX --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 a89ee9f7aa9454ab38fa86354119089629ffb03b95267a7d67f4e51e7c7ae615 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 12:23:10,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:23:10,370 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4b8d677-308d-40a9-b239-0a125fd9b5db/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 12:23:10,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:23:10,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:23:10,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:23:10,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:23:10,418 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:23:10,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 12:23:10,419 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 12:23:10,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:23:10,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:23:10,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:23:10,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:23:10,427 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:23:10,427 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:23:10,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 12:23:10,428 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:23:10,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 12:23:10,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:23:10,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:23:10,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 12:23:10,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:23:10,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 12:23:10,431 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:23:10,431 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:23:10,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 12:23:10,432 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:23:10,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:23:10,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:23:10,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 12:23:10,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:23:10,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:23:10,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:23:10,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:23:10,434 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 12:23:10,436 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 12:23:10,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 12:23:10,436 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:23:10,437 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 12:23:10,437 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 12:23:10,437 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 12:23:10,438 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4b8d677-308d-40a9-b239-0a125fd9b5db/bin/uautomizer-verify-jihMAELWvX/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4b8d677-308d-40a9-b239-0a125fd9b5db/bin/uautomizer-verify-jihMAELWvX 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 -> a89ee9f7aa9454ab38fa86354119089629ffb03b95267a7d67f4e51e7c7ae615 [2024-11-08 12:23:10,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:23:10,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:23:10,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:23:10,751 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:23:10,752 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:23:10,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4b8d677-308d-40a9-b239-0a125fd9b5db/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c Unable to find full path for "g++" [2024-11-08 12:23:13,131 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:23:13,415 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:23:13,416 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4b8d677-308d-40a9-b239-0a125fd9b5db/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-11-08 12:23:13,433 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4b8d677-308d-40a9-b239-0a125fd9b5db/bin/uautomizer-verify-jihMAELWvX/data/8cf1f1a55/12ff29f7f1d1433eba23f01e71208d9d/FLAGaaadc80bf [2024-11-08 12:23:13,704 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4b8d677-308d-40a9-b239-0a125fd9b5db/bin/uautomizer-verify-jihMAELWvX/data/8cf1f1a55/12ff29f7f1d1433eba23f01e71208d9d [2024-11-08 12:23:13,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:23:13,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:23:13,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:23:13,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:23:13,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:23:13,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:23:13" (1/1) ... [2024-11-08 12:23:13,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e5bcb4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:13, skipping insertion in model container [2024-11-08 12:23:13,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:23:13" (1/1) ... [2024-11-08 12:23:13,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:23:14,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4b8d677-308d-40a9-b239-0a125fd9b5db/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[10710,10723] [2024-11-08 12:23:14,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:23:14,232 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:23:14,326 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4b8d677-308d-40a9-b239-0a125fd9b5db/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[10710,10723] [2024-11-08 12:23:14,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:23:14,434 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:23:14,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:14 WrapperNode [2024-11-08 12:23:14,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:23:14,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:23:14,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:23:14,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:23:14,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:14" (1/1) ... [2024-11-08 12:23:14,460 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:14" (1/1) ... [2024-11-08 12:23:14,527 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1023 [2024-11-08 12:23:14,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:23:14,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:23:14,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:23:14,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:23:14,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:14" (1/1) ... [2024-11-08 12:23:14,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:14" (1/1) ... [2024-11-08 12:23:14,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:14" (1/1) ... [2024-11-08 12:23:14,587 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-11-08 12:23:14,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:14" (1/1) ... [2024-11-08 12:23:14,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:14" (1/1) ... [2024-11-08 12:23:14,619 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:14" (1/1) ... [2024-11-08 12:23:14,636 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:14" (1/1) ... [2024-11-08 12:23:14,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:14" (1/1) ... [2024-11-08 12:23:14,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:14" (1/1) ... [2024-11-08 12:23:14,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:23:14,665 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:23:14,666 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:23:14,666 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:23:14,667 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:14" (1/1) ... [2024-11-08 12:23:14,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:23:14,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4b8d677-308d-40a9-b239-0a125fd9b5db/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:23:14,726 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4b8d677-308d-40a9-b239-0a125fd9b5db/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 12:23:14,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4b8d677-308d-40a9-b239-0a125fd9b5db/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 12:23:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:23:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 12:23:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:23:14,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:23:14,960 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:23:14,963 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:23:16,253 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-11-08 12:23:16,253 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:23:16,278 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:23:16,279 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 12:23:16,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:23:16 BoogieIcfgContainer [2024-11-08 12:23:16,279 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:23:16,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:23:16,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:23:16,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:23:16,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:23:13" (1/3) ... [2024-11-08 12:23:16,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ee525b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:23:16, skipping insertion in model container [2024-11-08 12:23:16,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:14" (2/3) ... [2024-11-08 12:23:16,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ee525b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:23:16, skipping insertion in model container [2024-11-08 12:23:16,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:23:16" (3/3) ... [2024-11-08 12:23:16,291 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-11-08 12:23:16,314 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:23:16,314 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 12:23:16,413 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 12:23:16,419 INFO L333 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=LoopHeads, 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;@1be8bd1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:23:16,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:23:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 239 states have (on average 1.7656903765690377) internal successors, (422), 240 states have internal predecessors, (422), 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-11-08 12:23:16,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 12:23:16,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:16,437 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:16,437 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:16,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:16,443 INFO L85 PathProgramCache]: Analyzing trace with hash -574535014, now seen corresponding path program 1 times [2024-11-08 12:23:16,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:16,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294858286] [2024-11-08 12:23:16,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:16,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:17,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:17,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294858286] [2024-11-08 12:23:17,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294858286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:17,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:17,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:23:17,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949526552] [2024-11-08 12:23:17,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:17,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:23:17,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:17,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:23:17,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:17,103 INFO L87 Difference]: Start difference. First operand has 241 states, 239 states have (on average 1.7656903765690377) internal successors, (422), 240 states have internal predecessors, (422), 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) Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-11-08 12:23:17,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:17,272 INFO L93 Difference]: Finished difference Result 482 states and 831 transitions. [2024-11-08 12:23:17,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:23:17,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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) Word has length 100 [2024-11-08 12:23:17,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:17,291 INFO L225 Difference]: With dead ends: 482 [2024-11-08 12:23:17,292 INFO L226 Difference]: Without dead ends: 358 [2024-11-08 12:23:17,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:17,299 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 291 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:17,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 659 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 12:23:17,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-08 12:23:17,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2024-11-08 12:23:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 1.5295774647887324) internal successors, (543), 355 states have internal predecessors, (543), 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-11-08 12:23:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 543 transitions. [2024-11-08 12:23:17,400 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 543 transitions. Word has length 100 [2024-11-08 12:23:17,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:17,404 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 543 transitions. [2024-11-08 12:23:17,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-11-08 12:23:17,405 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 543 transitions. [2024-11-08 12:23:17,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 12:23:17,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:17,412 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:17,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 12:23:17,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:17,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:17,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1640633924, now seen corresponding path program 1 times [2024-11-08 12:23:17,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:17,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125850136] [2024-11-08 12:23:17,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:17,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:18,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:18,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:18,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125850136] [2024-11-08 12:23:18,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125850136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:18,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:18,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:23:18,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935670228] [2024-11-08 12:23:18,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:18,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:23:18,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:18,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:23:18,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:18,225 INFO L87 Difference]: Start difference. First operand 356 states and 543 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-11-08 12:23:18,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:18,376 INFO L93 Difference]: Finished difference Result 1346 states and 2040 transitions. [2024-11-08 12:23:18,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:23:18,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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) Word has length 100 [2024-11-08 12:23:18,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:18,384 INFO L225 Difference]: With dead ends: 1346 [2024-11-08 12:23:18,387 INFO L226 Difference]: Without dead ends: 1015 [2024-11-08 12:23:18,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:18,392 INFO L432 NwaCegarLoop]: 590 mSDtfsCounter, 615 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:18,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1215 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 12:23:18,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2024-11-08 12:23:18,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 685. [2024-11-08 12:23:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 684 states have (on average 1.513157894736842) internal successors, (1035), 684 states have internal predecessors, (1035), 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-11-08 12:23:18,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1035 transitions. [2024-11-08 12:23:18,463 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1035 transitions. Word has length 100 [2024-11-08 12:23:18,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:18,465 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1035 transitions. [2024-11-08 12:23:18,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-11-08 12:23:18,466 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1035 transitions. [2024-11-08 12:23:18,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 12:23:18,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:18,475 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:18,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 12:23:18,476 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:18,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:18,477 INFO L85 PathProgramCache]: Analyzing trace with hash -309110568, now seen corresponding path program 1 times [2024-11-08 12:23:18,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:18,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521883999] [2024-11-08 12:23:18,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:18,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:18,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:18,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:18,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521883999] [2024-11-08 12:23:18,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521883999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:18,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:18,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:23:18,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677608953] [2024-11-08 12:23:18,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:18,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:23:18,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:18,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:23:18,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:18,604 INFO L87 Difference]: Start difference. First operand 685 states and 1035 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-11-08 12:23:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:18,650 INFO L93 Difference]: Finished difference Result 1344 states and 2026 transitions. [2024-11-08 12:23:18,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:23:18,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) Word has length 101 [2024-11-08 12:23:18,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:18,654 INFO L225 Difference]: With dead ends: 1344 [2024-11-08 12:23:18,655 INFO L226 Difference]: Without dead ends: 687 [2024-11-08 12:23:18,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:18,661 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:18,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 704 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:23:18,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-08 12:23:18,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2024-11-08 12:23:18,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 1.5116618075801749) internal successors, (1037), 686 states have internal predecessors, (1037), 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-11-08 12:23:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1037 transitions. [2024-11-08 12:23:18,690 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1037 transitions. Word has length 101 [2024-11-08 12:23:18,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:18,691 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1037 transitions. [2024-11-08 12:23:18,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-11-08 12:23:18,692 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1037 transitions. [2024-11-08 12:23:18,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 12:23:18,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:18,698 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:18,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 12:23:18,699 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:18,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:18,699 INFO L85 PathProgramCache]: Analyzing trace with hash 923754978, now seen corresponding path program 1 times [2024-11-08 12:23:18,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:18,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914716950] [2024-11-08 12:23:18,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:18,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:18,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:18,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914716950] [2024-11-08 12:23:18,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914716950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:18,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:18,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:23:18,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160533212] [2024-11-08 12:23:18,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:18,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:23:18,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:18,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:23:18,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:18,899 INFO L87 Difference]: Start difference. First operand 687 states and 1037 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-11-08 12:23:18,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:18,974 INFO L93 Difference]: Finished difference Result 1818 states and 2762 transitions. [2024-11-08 12:23:18,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:23:18,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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) Word has length 102 [2024-11-08 12:23:18,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:18,982 INFO L225 Difference]: With dead ends: 1818 [2024-11-08 12:23:18,983 INFO L226 Difference]: Without dead ends: 1326 [2024-11-08 12:23:18,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:18,989 INFO L432 NwaCegarLoop]: 670 mSDtfsCounter, 282 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:18,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 992 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 12:23:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2024-11-08 12:23:19,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1324. [2024-11-08 12:23:19,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1323 states have (on average 1.4965986394557824) internal successors, (1980), 1323 states have internal predecessors, (1980), 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-11-08 12:23:19,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1980 transitions. [2024-11-08 12:23:19,034 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1980 transitions. Word has length 102 [2024-11-08 12:23:19,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:19,035 INFO L471 AbstractCegarLoop]: Abstraction has 1324 states and 1980 transitions. [2024-11-08 12:23:19,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-11-08 12:23:19,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1980 transitions. [2024-11-08 12:23:19,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 12:23:19,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:19,039 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:19,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 12:23:19,040 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:19,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:19,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1935849921, now seen corresponding path program 1 times [2024-11-08 12:23:19,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:19,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362465155] [2024-11-08 12:23:19,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:19,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:19,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:19,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:19,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362465155] [2024-11-08 12:23:19,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362465155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:19,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:19,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:23:19,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799620184] [2024-11-08 12:23:19,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:19,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:23:19,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:19,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:23:19,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:19,709 INFO L87 Difference]: Start difference. First operand 1324 states and 1980 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-11-08 12:23:19,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:19,758 INFO L93 Difference]: Finished difference Result 2153 states and 3240 transitions. [2024-11-08 12:23:19,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:23:19,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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) Word has length 102 [2024-11-08 12:23:19,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:19,763 INFO L225 Difference]: With dead ends: 2153 [2024-11-08 12:23:19,763 INFO L226 Difference]: Without dead ends: 1012 [2024-11-08 12:23:19,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:19,767 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 25 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:19,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1141 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:23:19,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2024-11-08 12:23:19,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012. [2024-11-08 12:23:19,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 1.4915924826904055) internal successors, (1508), 1011 states have internal predecessors, (1508), 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-11-08 12:23:19,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1508 transitions. [2024-11-08 12:23:19,805 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1508 transitions. Word has length 102 [2024-11-08 12:23:19,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:19,806 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1508 transitions. [2024-11-08 12:23:19,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-11-08 12:23:19,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1508 transitions. [2024-11-08 12:23:19,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 12:23:19,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:19,823 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:19,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 12:23:19,823 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:19,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:19,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1659633849, now seen corresponding path program 1 times [2024-11-08 12:23:19,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:19,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918938337] [2024-11-08 12:23:19,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:19,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:19,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:19,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:19,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918938337] [2024-11-08 12:23:19,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918938337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:19,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:19,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:23:19,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033511874] [2024-11-08 12:23:19,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:19,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:23:19,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:19,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:23:19,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:19,959 INFO L87 Difference]: Start difference. First operand 1012 states and 1508 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-11-08 12:23:20,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:20,025 INFO L93 Difference]: Finished difference Result 2287 states and 3528 transitions. [2024-11-08 12:23:20,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:23:20,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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) Word has length 102 [2024-11-08 12:23:20,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:20,032 INFO L225 Difference]: With dead ends: 2287 [2024-11-08 12:23:20,033 INFO L226 Difference]: Without dead ends: 1460 [2024-11-08 12:23:20,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:20,036 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 225 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:20,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 714 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:23:20,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2024-11-08 12:23:20,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1428. [2024-11-08 12:23:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1427 states have (on average 1.5325858444288718) internal successors, (2187), 1427 states have internal predecessors, (2187), 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-11-08 12:23:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2187 transitions. [2024-11-08 12:23:20,078 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 2187 transitions. Word has length 102 [2024-11-08 12:23:20,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:20,081 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 2187 transitions. [2024-11-08 12:23:20,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-11-08 12:23:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 2187 transitions. [2024-11-08 12:23:20,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 12:23:20,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:20,084 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:20,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 12:23:20,084 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:20,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:20,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1296481524, now seen corresponding path program 1 times [2024-11-08 12:23:20,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:20,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618829516] [2024-11-08 12:23:20,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:20,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:20,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:20,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618829516] [2024-11-08 12:23:20,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618829516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:20,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:20,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:23:20,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923534735] [2024-11-08 12:23:20,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:20,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:23:20,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:20,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:23:20,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:20,220 INFO L87 Difference]: Start difference. First operand 1428 states and 2187 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-11-08 12:23:20,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:20,290 INFO L93 Difference]: Finished difference Result 3393 states and 5354 transitions. [2024-11-08 12:23:20,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:23:20,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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) Word has length 104 [2024-11-08 12:23:20,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:20,298 INFO L225 Difference]: With dead ends: 3393 [2024-11-08 12:23:20,298 INFO L226 Difference]: Without dead ends: 2234 [2024-11-08 12:23:20,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:20,301 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 237 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:20,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 689 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:23:20,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2024-11-08 12:23:20,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2172. [2024-11-08 12:23:20,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2172 states, 2171 states have (on average 1.562874251497006) internal successors, (3393), 2171 states have internal predecessors, (3393), 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-11-08 12:23:20,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 3393 transitions. [2024-11-08 12:23:20,363 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 3393 transitions. Word has length 104 [2024-11-08 12:23:20,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:20,364 INFO L471 AbstractCegarLoop]: Abstraction has 2172 states and 3393 transitions. [2024-11-08 12:23:20,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-11-08 12:23:20,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 3393 transitions. [2024-11-08 12:23:20,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 12:23:20,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:20,366 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:20,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 12:23:20,367 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:20,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:20,367 INFO L85 PathProgramCache]: Analyzing trace with hash -600271295, now seen corresponding path program 1 times [2024-11-08 12:23:20,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:20,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391074569] [2024-11-08 12:23:20,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:20,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:20,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:20,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:20,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391074569] [2024-11-08 12:23:20,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391074569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:20,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:20,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:23:20,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681335230] [2024-11-08 12:23:20,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:20,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:23:20,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:20,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:23:20,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:20,827 INFO L87 Difference]: Start difference. First operand 2172 states and 3393 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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-11-08 12:23:20,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:20,938 INFO L93 Difference]: Finished difference Result 5607 states and 8769 transitions. [2024-11-08 12:23:20,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:23:20,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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) Word has length 105 [2024-11-08 12:23:20,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:20,951 INFO L225 Difference]: With dead ends: 5607 [2024-11-08 12:23:20,951 INFO L226 Difference]: Without dead ends: 3472 [2024-11-08 12:23:20,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:20,955 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 573 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:20,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 891 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 12:23:20,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2024-11-08 12:23:21,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 3470. [2024-11-08 12:23:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3470 states, 3469 states have (on average 1.553473623522629) internal successors, (5389), 3469 states have internal predecessors, (5389), 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-11-08 12:23:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3470 states to 3470 states and 5389 transitions. [2024-11-08 12:23:21,061 INFO L78 Accepts]: Start accepts. Automaton has 3470 states and 5389 transitions. Word has length 105 [2024-11-08 12:23:21,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:21,062 INFO L471 AbstractCegarLoop]: Abstraction has 3470 states and 5389 transitions. [2024-11-08 12:23:21,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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-11-08 12:23:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3470 states and 5389 transitions. [2024-11-08 12:23:21,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 12:23:21,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:21,065 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:21,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 12:23:21,065 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:21,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:21,066 INFO L85 PathProgramCache]: Analyzing trace with hash 277686540, now seen corresponding path program 1 times [2024-11-08 12:23:21,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:21,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739059032] [2024-11-08 12:23:21,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:21,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:21,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:21,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739059032] [2024-11-08 12:23:21,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739059032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:21,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:21,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:23:21,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330603260] [2024-11-08 12:23:21,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:21,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:23:21,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:21,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:23:21,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:21,190 INFO L87 Difference]: Start difference. First operand 3470 states and 5389 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-11-08 12:23:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:21,317 INFO L93 Difference]: Finished difference Result 7482 states and 11643 transitions. [2024-11-08 12:23:21,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:23:21,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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) Word has length 106 [2024-11-08 12:23:21,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:21,338 INFO L225 Difference]: With dead ends: 7482 [2024-11-08 12:23:21,339 INFO L226 Difference]: Without dead ends: 4827 [2024-11-08 12:23:21,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:21,345 INFO L432 NwaCegarLoop]: 603 mSDtfsCounter, 326 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:21,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 946 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:23:21,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2024-11-08 12:23:21,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 3470. [2024-11-08 12:23:21,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3470 states, 3469 states have (on average 1.5531853560103777) internal successors, (5388), 3469 states have internal predecessors, (5388), 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-11-08 12:23:21,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3470 states to 3470 states and 5388 transitions. [2024-11-08 12:23:21,478 INFO L78 Accepts]: Start accepts. Automaton has 3470 states and 5388 transitions. Word has length 106 [2024-11-08 12:23:21,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:21,479 INFO L471 AbstractCegarLoop]: Abstraction has 3470 states and 5388 transitions. [2024-11-08 12:23:21,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-11-08 12:23:21,479 INFO L276 IsEmpty]: Start isEmpty. Operand 3470 states and 5388 transitions. [2024-11-08 12:23:21,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 12:23:21,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:21,482 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:21,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 12:23:21,482 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:21,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:21,483 INFO L85 PathProgramCache]: Analyzing trace with hash -668110988, now seen corresponding path program 1 times [2024-11-08 12:23:21,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:21,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043796924] [2024-11-08 12:23:21,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:21,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:22,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:22,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:22,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043796924] [2024-11-08 12:23:22,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043796924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:22,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:22,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:23:22,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827268154] [2024-11-08 12:23:22,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:22,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:23:22,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:22,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:23:22,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:22,010 INFO L87 Difference]: Start difference. First operand 3470 states and 5388 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-11-08 12:23:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:22,078 INFO L93 Difference]: Finished difference Result 6919 states and 10744 transitions. [2024-11-08 12:23:22,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:23:22,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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) Word has length 107 [2024-11-08 12:23:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:22,089 INFO L225 Difference]: With dead ends: 6919 [2024-11-08 12:23:22,090 INFO L226 Difference]: Without dead ends: 3470 [2024-11-08 12:23:22,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:22,094 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 20 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:22,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1109 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:23:22,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2024-11-08 12:23:22,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 3470. [2024-11-08 12:23:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3470 states, 3469 states have (on average 1.5523205534736235) internal successors, (5385), 3469 states have internal predecessors, (5385), 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-11-08 12:23:22,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3470 states to 3470 states and 5385 transitions. [2024-11-08 12:23:22,187 INFO L78 Accepts]: Start accepts. Automaton has 3470 states and 5385 transitions. Word has length 107 [2024-11-08 12:23:22,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:22,188 INFO L471 AbstractCegarLoop]: Abstraction has 3470 states and 5385 transitions. [2024-11-08 12:23:22,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-11-08 12:23:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3470 states and 5385 transitions. [2024-11-08 12:23:22,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 12:23:22,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:22,190 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:22,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 12:23:22,191 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:22,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:22,191 INFO L85 PathProgramCache]: Analyzing trace with hash -854881039, now seen corresponding path program 1 times [2024-11-08 12:23:22,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:22,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99450882] [2024-11-08 12:23:22,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:22,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:22,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:22,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99450882] [2024-11-08 12:23:22,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99450882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:22,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:22,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:23:22,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399731501] [2024-11-08 12:23:22,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:22,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:23:22,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:22,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:23:22,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:22,319 INFO L87 Difference]: Start difference. First operand 3470 states and 5385 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-11-08 12:23:22,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:22,399 INFO L93 Difference]: Finished difference Result 8474 states and 13224 transitions. [2024-11-08 12:23:22,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:23:22,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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) Word has length 107 [2024-11-08 12:23:22,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:22,421 INFO L225 Difference]: With dead ends: 8474 [2024-11-08 12:23:22,425 INFO L226 Difference]: Without dead ends: 5384 [2024-11-08 12:23:22,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:22,430 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 275 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:22,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 766 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:23:22,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5384 states. [2024-11-08 12:23:22,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5384 to 5382. [2024-11-08 12:23:22,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5382 states, 5381 states have (on average 1.534658985318714) internal successors, (8258), 5381 states have internal predecessors, (8258), 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-11-08 12:23:22,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5382 states to 5382 states and 8258 transitions. [2024-11-08 12:23:22,594 INFO L78 Accepts]: Start accepts. Automaton has 5382 states and 8258 transitions. Word has length 107 [2024-11-08 12:23:22,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:22,595 INFO L471 AbstractCegarLoop]: Abstraction has 5382 states and 8258 transitions. [2024-11-08 12:23:22,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-11-08 12:23:22,595 INFO L276 IsEmpty]: Start isEmpty. Operand 5382 states and 8258 transitions. [2024-11-08 12:23:22,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 12:23:22,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:22,598 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:22,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 12:23:22,598 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:22,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:22,599 INFO L85 PathProgramCache]: Analyzing trace with hash 914270762, now seen corresponding path program 1 times [2024-11-08 12:23:22,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:22,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703602517] [2024-11-08 12:23:22,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:22,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:22,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:22,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703602517] [2024-11-08 12:23:22,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703602517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:22,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:22,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:23:22,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456922670] [2024-11-08 12:23:22,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:22,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:23:22,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:22,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:23:22,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:22,716 INFO L87 Difference]: Start difference. First operand 5382 states and 8258 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-11-08 12:23:22,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:22,823 INFO L93 Difference]: Finished difference Result 14007 states and 21922 transitions. [2024-11-08 12:23:22,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:23:22,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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) Word has length 109 [2024-11-08 12:23:22,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:22,854 INFO L225 Difference]: With dead ends: 14007 [2024-11-08 12:23:22,854 INFO L226 Difference]: Without dead ends: 9036 [2024-11-08 12:23:22,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:22,863 INFO L432 NwaCegarLoop]: 471 mSDtfsCounter, 225 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:22,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 693 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:23:22,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9036 states. [2024-11-08 12:23:23,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9036 to 8754. [2024-11-08 12:23:23,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8754 states, 8753 states have (on average 1.559236833085799) internal successors, (13648), 8753 states have internal predecessors, (13648), 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-11-08 12:23:23,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8754 states to 8754 states and 13648 transitions. [2024-11-08 12:23:23,079 INFO L78 Accepts]: Start accepts. Automaton has 8754 states and 13648 transitions. Word has length 109 [2024-11-08 12:23:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:23,079 INFO L471 AbstractCegarLoop]: Abstraction has 8754 states and 13648 transitions. [2024-11-08 12:23:23,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-11-08 12:23:23,081 INFO L276 IsEmpty]: Start isEmpty. Operand 8754 states and 13648 transitions. [2024-11-08 12:23:23,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 12:23:23,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:23,084 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:23,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 12:23:23,084 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:23,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:23,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1141316501, now seen corresponding path program 1 times [2024-11-08 12:23:23,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:23,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790631814] [2024-11-08 12:23:23,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:23,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:23,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:23,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:23,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790631814] [2024-11-08 12:23:23,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790631814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:23,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:23,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:23:23,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355827578] [2024-11-08 12:23:23,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:23,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:23:23,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:23,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:23:23,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:23,546 INFO L87 Difference]: Start difference. First operand 8754 states and 13648 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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-11-08 12:23:23,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:23,869 INFO L93 Difference]: Finished difference Result 39996 states and 62238 transitions. [2024-11-08 12:23:23,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:23:23,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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) Word has length 110 [2024-11-08 12:23:23,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:23,953 INFO L225 Difference]: With dead ends: 39996 [2024-11-08 12:23:23,953 INFO L226 Difference]: Without dead ends: 31291 [2024-11-08 12:23:23,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:23:23,973 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 928 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:23,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1458 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 12:23:24,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31291 states. [2024-11-08 12:23:24,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31291 to 15697. [2024-11-08 12:23:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15697 states, 15696 states have (on average 1.541156982670744) internal successors, (24190), 15696 states have internal predecessors, (24190), 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-11-08 12:23:24,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15697 states to 15697 states and 24190 transitions. [2024-11-08 12:23:24,757 INFO L78 Accepts]: Start accepts. Automaton has 15697 states and 24190 transitions. Word has length 110 [2024-11-08 12:23:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:24,758 INFO L471 AbstractCegarLoop]: Abstraction has 15697 states and 24190 transitions. [2024-11-08 12:23:24,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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-11-08 12:23:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 15697 states and 24190 transitions. [2024-11-08 12:23:24,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 12:23:24,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:24,765 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:24,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 12:23:24,765 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:24,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:24,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1423961921, now seen corresponding path program 1 times [2024-11-08 12:23:24,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:24,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133035247] [2024-11-08 12:23:24,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:24,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:24,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:24,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:24,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133035247] [2024-11-08 12:23:24,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133035247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:24,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:24,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:23:24,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050749441] [2024-11-08 12:23:24,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:24,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:23:24,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:24,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:23:24,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:24,899 INFO L87 Difference]: Start difference. First operand 15697 states and 24190 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-11-08 12:23:25,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:25,121 INFO L93 Difference]: Finished difference Result 31279 states and 48227 transitions. [2024-11-08 12:23:25,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:23:25,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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) Word has length 111 [2024-11-08 12:23:25,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:25,165 INFO L225 Difference]: With dead ends: 31279 [2024-11-08 12:23:25,165 INFO L226 Difference]: Without dead ends: 15705 [2024-11-08 12:23:25,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:25,186 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:25,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 684 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:23:25,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15705 states. [2024-11-08 12:23:25,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15705 to 15705. [2024-11-08 12:23:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15705 states, 15704 states have (on average 1.5408813041263372) internal successors, (24198), 15704 states have internal predecessors, (24198), 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-11-08 12:23:25,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15705 states to 15705 states and 24198 transitions. [2024-11-08 12:23:25,823 INFO L78 Accepts]: Start accepts. Automaton has 15705 states and 24198 transitions. Word has length 111 [2024-11-08 12:23:25,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:25,824 INFO L471 AbstractCegarLoop]: Abstraction has 15705 states and 24198 transitions. [2024-11-08 12:23:25,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-11-08 12:23:25,824 INFO L276 IsEmpty]: Start isEmpty. Operand 15705 states and 24198 transitions. [2024-11-08 12:23:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 12:23:25,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:25,829 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:25,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 12:23:25,830 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:25,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:25,831 INFO L85 PathProgramCache]: Analyzing trace with hash 396960300, now seen corresponding path program 1 times [2024-11-08 12:23:25,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:25,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333513898] [2024-11-08 12:23:25,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:25,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:26,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:26,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333513898] [2024-11-08 12:23:26,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333513898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:26,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:26,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:23:26,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978652066] [2024-11-08 12:23:26,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:26,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:23:26,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:26,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:23:26,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:26,607 INFO L87 Difference]: Start difference. First operand 15705 states and 24198 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-11-08 12:23:26,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:26,835 INFO L93 Difference]: Finished difference Result 31283 states and 48229 transitions. [2024-11-08 12:23:26,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:23:26,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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) Word has length 112 [2024-11-08 12:23:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:26,878 INFO L225 Difference]: With dead ends: 31283 [2024-11-08 12:23:26,878 INFO L226 Difference]: Without dead ends: 15705 [2024-11-08 12:23:26,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:26,903 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 10 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:26,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1073 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:23:26,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15705 states. [2024-11-08 12:23:27,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15705 to 15701. [2024-11-08 12:23:27,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15701 states, 15700 states have (on average 1.5407006369426752) internal successors, (24189), 15700 states have internal predecessors, (24189), 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-11-08 12:23:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15701 states to 15701 states and 24189 transitions. [2024-11-08 12:23:27,418 INFO L78 Accepts]: Start accepts. Automaton has 15701 states and 24189 transitions. Word has length 112 [2024-11-08 12:23:27,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:27,419 INFO L471 AbstractCegarLoop]: Abstraction has 15701 states and 24189 transitions. [2024-11-08 12:23:27,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-11-08 12:23:27,419 INFO L276 IsEmpty]: Start isEmpty. Operand 15701 states and 24189 transitions. [2024-11-08 12:23:27,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 12:23:27,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:27,425 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:27,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 12:23:27,425 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:27,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:27,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1369855469, now seen corresponding path program 1 times [2024-11-08 12:23:27,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:27,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001710248] [2024-11-08 12:23:27,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:27,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:27,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:27,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001710248] [2024-11-08 12:23:27,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001710248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:27,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:27,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:23:27,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846011400] [2024-11-08 12:23:27,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:27,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:23:27,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:27,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:23:27,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:27,577 INFO L87 Difference]: Start difference. First operand 15701 states and 24189 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-11-08 12:23:27,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:27,824 INFO L93 Difference]: Finished difference Result 40537 states and 62486 transitions. [2024-11-08 12:23:27,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:23:27,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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) Word has length 112 [2024-11-08 12:23:27,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:27,890 INFO L225 Difference]: With dead ends: 40537 [2024-11-08 12:23:27,890 INFO L226 Difference]: Without dead ends: 25727 [2024-11-08 12:23:28,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:28,066 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 258 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:28,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 934 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:23:28,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25727 states. [2024-11-08 12:23:28,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25727 to 25725. [2024-11-08 12:23:28,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25725 states, 25724 states have (on average 1.5157051780438502) internal successors, (38990), 25724 states have internal predecessors, (38990), 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-11-08 12:23:28,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25725 states to 25725 states and 38990 transitions. [2024-11-08 12:23:28,951 INFO L78 Accepts]: Start accepts. Automaton has 25725 states and 38990 transitions. Word has length 112 [2024-11-08 12:23:28,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:28,952 INFO L471 AbstractCegarLoop]: Abstraction has 25725 states and 38990 transitions. [2024-11-08 12:23:28,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-11-08 12:23:28,952 INFO L276 IsEmpty]: Start isEmpty. Operand 25725 states and 38990 transitions. [2024-11-08 12:23:28,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 12:23:28,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:28,961 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:28,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 12:23:28,962 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:28,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:28,962 INFO L85 PathProgramCache]: Analyzing trace with hash -841170806, now seen corresponding path program 1 times [2024-11-08 12:23:28,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:28,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192138998] [2024-11-08 12:23:28,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:28,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:29,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:29,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192138998] [2024-11-08 12:23:29,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192138998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:29,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:29,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:23:29,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867005014] [2024-11-08 12:23:29,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:29,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:23:29,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:29,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:23:29,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:29,554 INFO L87 Difference]: Start difference. First operand 25725 states and 38990 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-11-08 12:23:29,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:29,850 INFO L93 Difference]: Finished difference Result 47593 states and 72455 transitions. [2024-11-08 12:23:29,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:23:29,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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) Word has length 112 [2024-11-08 12:23:29,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:29,904 INFO L225 Difference]: With dead ends: 47593 [2024-11-08 12:23:29,904 INFO L226 Difference]: Without dead ends: 22681 [2024-11-08 12:23:29,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:29,924 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 13 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:29,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1077 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:23:29,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22681 states. [2024-11-08 12:23:30,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22681 to 22681. [2024-11-08 12:23:30,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22681 states, 22680 states have (on average 1.5175044091710759) internal successors, (34417), 22680 states have internal predecessors, (34417), 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-11-08 12:23:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22681 states to 22681 states and 34417 transitions. [2024-11-08 12:23:30,600 INFO L78 Accepts]: Start accepts. Automaton has 22681 states and 34417 transitions. Word has length 112 [2024-11-08 12:23:30,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:30,600 INFO L471 AbstractCegarLoop]: Abstraction has 22681 states and 34417 transitions. [2024-11-08 12:23:30,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-11-08 12:23:30,601 INFO L276 IsEmpty]: Start isEmpty. Operand 22681 states and 34417 transitions. [2024-11-08 12:23:30,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 12:23:30,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:30,609 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:30,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 12:23:30,609 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:30,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:30,610 INFO L85 PathProgramCache]: Analyzing trace with hash -114669100, now seen corresponding path program 1 times [2024-11-08 12:23:30,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:30,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796434596] [2024-11-08 12:23:30,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:30,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:31,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:31,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:31,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796434596] [2024-11-08 12:23:31,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796434596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:31,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:31,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:23:31,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612485030] [2024-11-08 12:23:31,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:31,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:23:31,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:31,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:23:31,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:23:31,177 INFO L87 Difference]: Start difference. First operand 22681 states and 34417 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-11-08 12:23:31,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:31,652 INFO L93 Difference]: Finished difference Result 61837 states and 95835 transitions. [2024-11-08 12:23:31,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:23:31,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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) Word has length 115 [2024-11-08 12:23:31,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:31,750 INFO L225 Difference]: With dead ends: 61837 [2024-11-08 12:23:31,750 INFO L226 Difference]: Without dead ends: 42259 [2024-11-08 12:23:31,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:23:31,770 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 200 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:31,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1103 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 12:23:31,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42259 states. [2024-11-08 12:23:32,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42259 to 42173. [2024-11-08 12:23:32,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42173 states, 42172 states have (on average 1.5178080242815137) internal successors, (64009), 42172 states have internal predecessors, (64009), 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-11-08 12:23:32,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42173 states to 42173 states and 64009 transitions. [2024-11-08 12:23:32,757 INFO L78 Accepts]: Start accepts. Automaton has 42173 states and 64009 transitions. Word has length 115 [2024-11-08 12:23:32,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:32,757 INFO L471 AbstractCegarLoop]: Abstraction has 42173 states and 64009 transitions. [2024-11-08 12:23:32,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-11-08 12:23:32,758 INFO L276 IsEmpty]: Start isEmpty. Operand 42173 states and 64009 transitions. [2024-11-08 12:23:32,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 12:23:32,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:32,765 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:32,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 12:23:32,765 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:32,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:32,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1641098498, now seen corresponding path program 1 times [2024-11-08 12:23:32,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:32,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669092104] [2024-11-08 12:23:32,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:32,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:33,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:33,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:33,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669092104] [2024-11-08 12:23:33,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669092104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:33,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:33,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:23:33,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598514455] [2024-11-08 12:23:33,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:33,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:23:33,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:33,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:23:33,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:23:33,068 INFO L87 Difference]: Start difference. First operand 42173 states and 64009 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 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-11-08 12:23:33,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:33,775 INFO L93 Difference]: Finished difference Result 80231 states and 122095 transitions. [2024-11-08 12:23:33,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:23:33,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 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) Word has length 115 [2024-11-08 12:23:33,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:33,888 INFO L225 Difference]: With dead ends: 80231 [2024-11-08 12:23:33,888 INFO L226 Difference]: Without dead ends: 42173 [2024-11-08 12:23:33,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 12:23:33,918 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 849 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:33,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 351 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 12:23:33,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42173 states. [2024-11-08 12:23:34,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42173 to 42173. [2024-11-08 12:23:34,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42173 states, 42172 states have (on average 1.5064260646874703) internal successors, (63529), 42172 states have internal predecessors, (63529), 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-11-08 12:23:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42173 states to 42173 states and 63529 transitions. [2024-11-08 12:23:35,419 INFO L78 Accepts]: Start accepts. Automaton has 42173 states and 63529 transitions. Word has length 115 [2024-11-08 12:23:35,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:35,419 INFO L471 AbstractCegarLoop]: Abstraction has 42173 states and 63529 transitions. [2024-11-08 12:23:35,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 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-11-08 12:23:35,419 INFO L276 IsEmpty]: Start isEmpty. Operand 42173 states and 63529 transitions. [2024-11-08 12:23:35,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 12:23:35,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:35,427 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:35,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 12:23:35,427 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:35,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:35,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2012038621, now seen corresponding path program 1 times [2024-11-08 12:23:35,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:35,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340778928] [2024-11-08 12:23:35,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:35,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:35,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:35,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:35,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340778928] [2024-11-08 12:23:35,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340778928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:35,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:35,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 12:23:35,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351449633] [2024-11-08 12:23:35,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:35,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 12:23:35,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:35,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 12:23:35,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 12:23:35,928 INFO L87 Difference]: Start difference. First operand 42173 states and 63529 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 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-11-08 12:23:36,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:36,379 INFO L93 Difference]: Finished difference Result 81791 states and 124065 transitions. [2024-11-08 12:23:36,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:23:36,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 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) Word has length 115 [2024-11-08 12:23:36,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:36,451 INFO L225 Difference]: With dead ends: 81791 [2024-11-08 12:23:36,451 INFO L226 Difference]: Without dead ends: 42175 [2024-11-08 12:23:36,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 12:23:36,482 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 1304 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:36,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1304 Valid, 939 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 12:23:36,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42175 states. [2024-11-08 12:23:37,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42175 to 42173. [2024-11-08 12:23:37,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42173 states, 42172 states have (on average 1.501873280849853) internal successors, (63337), 42172 states have internal predecessors, (63337), 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-11-08 12:23:37,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42173 states to 42173 states and 63337 transitions. [2024-11-08 12:23:37,490 INFO L78 Accepts]: Start accepts. Automaton has 42173 states and 63337 transitions. Word has length 115 [2024-11-08 12:23:37,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:37,490 INFO L471 AbstractCegarLoop]: Abstraction has 42173 states and 63337 transitions. [2024-11-08 12:23:37,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 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-11-08 12:23:37,491 INFO L276 IsEmpty]: Start isEmpty. Operand 42173 states and 63337 transitions. [2024-11-08 12:23:37,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 12:23:37,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:37,506 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:37,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 12:23:37,507 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:37,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:37,510 INFO L85 PathProgramCache]: Analyzing trace with hash 452099970, now seen corresponding path program 1 times [2024-11-08 12:23:37,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:37,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528617630] [2024-11-08 12:23:37,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:37,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:38,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:38,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:38,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528617630] [2024-11-08 12:23:38,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528617630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:38,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:38,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:23:38,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181756954] [2024-11-08 12:23:38,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:38,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:23:38,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:38,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:23:38,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:38,189 INFO L87 Difference]: Start difference. First operand 42173 states and 63337 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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-11-08 12:23:38,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:38,482 INFO L93 Difference]: Finished difference Result 69957 states and 105101 transitions. [2024-11-08 12:23:38,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:23:38,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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) Word has length 115 [2024-11-08 12:23:38,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:38,538 INFO L225 Difference]: With dead ends: 69957 [2024-11-08 12:23:38,538 INFO L226 Difference]: Without dead ends: 39175 [2024-11-08 12:23:38,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:23:38,562 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 268 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:38,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 960 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 12:23:38,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39175 states. [2024-11-08 12:23:39,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39175 to 38967. [2024-11-08 12:23:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38967 states, 38966 states have (on average 1.5010008725555612) internal successors, (58488), 38966 states have internal predecessors, (58488), 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-11-08 12:23:39,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38967 states to 38967 states and 58488 transitions. [2024-11-08 12:23:39,548 INFO L78 Accepts]: Start accepts. Automaton has 38967 states and 58488 transitions. Word has length 115 [2024-11-08 12:23:39,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:39,549 INFO L471 AbstractCegarLoop]: Abstraction has 38967 states and 58488 transitions. [2024-11-08 12:23:39,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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-11-08 12:23:39,549 INFO L276 IsEmpty]: Start isEmpty. Operand 38967 states and 58488 transitions. [2024-11-08 12:23:39,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 12:23:39,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:39,558 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:39,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 12:23:39,558 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:39,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:39,559 INFO L85 PathProgramCache]: Analyzing trace with hash 630278213, now seen corresponding path program 1 times [2024-11-08 12:23:39,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:39,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898879510] [2024-11-08 12:23:39,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:39,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:40,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:40,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898879510] [2024-11-08 12:23:40,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898879510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:40,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:40,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:23:40,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250028024] [2024-11-08 12:23:40,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:40,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:23:40,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:40,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:23:40,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:40,166 INFO L87 Difference]: Start difference. First operand 38967 states and 58488 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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-11-08 12:23:40,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:40,624 INFO L93 Difference]: Finished difference Result 80479 states and 120951 transitions. [2024-11-08 12:23:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:23:40,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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) Word has length 117 [2024-11-08 12:23:40,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:40,737 INFO L225 Difference]: With dead ends: 80479 [2024-11-08 12:23:40,737 INFO L226 Difference]: Without dead ends: 52287 [2024-11-08 12:23:40,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:40,773 INFO L432 NwaCegarLoop]: 521 mSDtfsCounter, 542 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:40,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 1086 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 12:23:40,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52287 states. [2024-11-08 12:23:42,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52287 to 39111. [2024-11-08 12:23:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39111 states, 39110 states have (on average 1.499667604193301) internal successors, (58652), 39110 states have internal predecessors, (58652), 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-11-08 12:23:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39111 states to 39111 states and 58652 transitions. [2024-11-08 12:23:42,375 INFO L78 Accepts]: Start accepts. Automaton has 39111 states and 58652 transitions. Word has length 117 [2024-11-08 12:23:42,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:42,376 INFO L471 AbstractCegarLoop]: Abstraction has 39111 states and 58652 transitions. [2024-11-08 12:23:42,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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-11-08 12:23:42,376 INFO L276 IsEmpty]: Start isEmpty. Operand 39111 states and 58652 transitions. [2024-11-08 12:23:42,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 12:23:42,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:42,382 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:42,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 12:23:42,382 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:42,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:42,383 INFO L85 PathProgramCache]: Analyzing trace with hash 856369869, now seen corresponding path program 1 times [2024-11-08 12:23:42,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:42,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125779744] [2024-11-08 12:23:42,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:42,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:42,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:42,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125779744] [2024-11-08 12:23:42,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125779744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:42,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:42,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:23:42,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817097389] [2024-11-08 12:23:42,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:42,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:23:42,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:42,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:23:42,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:42,491 INFO L87 Difference]: Start difference. First operand 39111 states and 58652 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-11-08 12:23:42,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:42,754 INFO L93 Difference]: Finished difference Result 77723 states and 116716 transitions. [2024-11-08 12:23:42,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:23:42,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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) Word has length 118 [2024-11-08 12:23:42,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:42,826 INFO L225 Difference]: With dead ends: 77723 [2024-11-08 12:23:42,827 INFO L226 Difference]: Without dead ends: 39131 [2024-11-08 12:23:42,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:42,857 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 0 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:42,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 668 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:23:42,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39131 states. [2024-11-08 12:23:43,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39131 to 39131. [2024-11-08 12:23:43,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39131 states, 39130 states have (on average 1.4994122156912855) internal successors, (58672), 39130 states have internal predecessors, (58672), 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-11-08 12:23:44,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39131 states to 39131 states and 58672 transitions. [2024-11-08 12:23:44,026 INFO L78 Accepts]: Start accepts. Automaton has 39131 states and 58672 transitions. Word has length 118 [2024-11-08 12:23:44,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:44,027 INFO L471 AbstractCegarLoop]: Abstraction has 39131 states and 58672 transitions. [2024-11-08 12:23:44,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-11-08 12:23:44,027 INFO L276 IsEmpty]: Start isEmpty. Operand 39131 states and 58672 transitions. [2024-11-08 12:23:44,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 12:23:44,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:44,032 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:44,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 12:23:44,032 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:44,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:44,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1613219331, now seen corresponding path program 1 times [2024-11-08 12:23:44,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:44,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760709461] [2024-11-08 12:23:44,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:44,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:44,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:44,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760709461] [2024-11-08 12:23:44,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760709461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:44,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:44,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:23:44,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431379678] [2024-11-08 12:23:44,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:44,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:23:44,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:44,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:23:44,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:44,504 INFO L87 Difference]: Start difference. First operand 39131 states and 58672 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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-11-08 12:23:44,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:44,841 INFO L93 Difference]: Finished difference Result 78607 states and 117697 transitions. [2024-11-08 12:23:44,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:23:44,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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) Word has length 119 [2024-11-08 12:23:44,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:44,907 INFO L225 Difference]: With dead ends: 78607 [2024-11-08 12:23:44,907 INFO L226 Difference]: Without dead ends: 39608 [2024-11-08 12:23:44,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:23:44,936 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 270 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:44,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1313 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 12:23:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39608 states. [2024-11-08 12:23:45,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39608 to 39335. [2024-11-08 12:23:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39335 states, 39334 states have (on average 1.4966187013779428) internal successors, (58868), 39334 states have internal predecessors, (58868), 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-11-08 12:23:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39335 states to 39335 states and 58868 transitions. [2024-11-08 12:23:45,860 INFO L78 Accepts]: Start accepts. Automaton has 39335 states and 58868 transitions. Word has length 119 [2024-11-08 12:23:45,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:45,860 INFO L471 AbstractCegarLoop]: Abstraction has 39335 states and 58868 transitions. [2024-11-08 12:23:45,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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-11-08 12:23:45,860 INFO L276 IsEmpty]: Start isEmpty. Operand 39335 states and 58868 transitions. [2024-11-08 12:23:45,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 12:23:45,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:45,864 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:45,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 12:23:45,864 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:45,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:45,865 INFO L85 PathProgramCache]: Analyzing trace with hash 88340068, now seen corresponding path program 1 times [2024-11-08 12:23:45,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:45,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554284232] [2024-11-08 12:23:45,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:45,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:46,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:46,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:46,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554284232] [2024-11-08 12:23:46,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554284232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:46,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:46,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:23:46,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815510610] [2024-11-08 12:23:46,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:46,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:23:46,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:46,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:23:46,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:46,362 INFO L87 Difference]: Start difference. First operand 39335 states and 58868 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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-11-08 12:23:46,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:46,962 INFO L93 Difference]: Finished difference Result 69175 states and 103621 transitions. [2024-11-08 12:23:46,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:23:46,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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) Word has length 119 [2024-11-08 12:23:46,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:47,020 INFO L225 Difference]: With dead ends: 69175 [2024-11-08 12:23:47,021 INFO L226 Difference]: Without dead ends: 36120 [2024-11-08 12:23:47,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:47,048 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 3 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:47,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1034 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:23:47,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36120 states. [2024-11-08 12:23:47,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36120 to 36118. [2024-11-08 12:23:47,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36118 states, 36117 states have (on average 1.4966082454245924) internal successors, (54053), 36117 states have internal predecessors, (54053), 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-11-08 12:23:47,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36118 states to 36118 states and 54053 transitions. [2024-11-08 12:23:47,790 INFO L78 Accepts]: Start accepts. Automaton has 36118 states and 54053 transitions. Word has length 119 [2024-11-08 12:23:47,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:47,791 INFO L471 AbstractCegarLoop]: Abstraction has 36118 states and 54053 transitions. [2024-11-08 12:23:47,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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-11-08 12:23:47,791 INFO L276 IsEmpty]: Start isEmpty. Operand 36118 states and 54053 transitions. [2024-11-08 12:23:47,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 12:23:47,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:47,797 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:47,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 12:23:47,797 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:47,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:47,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1270508008, now seen corresponding path program 1 times [2024-11-08 12:23:47,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:47,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588390936] [2024-11-08 12:23:47,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:47,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:47,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:47,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588390936] [2024-11-08 12:23:47,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588390936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:47,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:47,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:23:47,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573286153] [2024-11-08 12:23:47,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:47,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:23:47,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:47,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:23:47,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:47,945 INFO L87 Difference]: Start difference. First operand 36118 states and 54053 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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-11-08 12:23:48,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:48,258 INFO L93 Difference]: Finished difference Result 70168 states and 105048 transitions. [2024-11-08 12:23:48,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:23:48,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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) Word has length 120 [2024-11-08 12:23:48,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:48,328 INFO L225 Difference]: With dead ends: 70168 [2024-11-08 12:23:48,329 INFO L226 Difference]: Without dead ends: 50310 [2024-11-08 12:23:48,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:48,355 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 294 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:48,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 868 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:23:48,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50310 states. [2024-11-08 12:23:49,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50310 to 36118. [2024-11-08 12:23:49,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36118 states, 36117 states have (on average 1.4964698064623307) internal successors, (54048), 36117 states have internal predecessors, (54048), 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-11-08 12:23:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36118 states to 36118 states and 54048 transitions. [2024-11-08 12:23:49,366 INFO L78 Accepts]: Start accepts. Automaton has 36118 states and 54048 transitions. Word has length 120 [2024-11-08 12:23:49,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:49,367 INFO L471 AbstractCegarLoop]: Abstraction has 36118 states and 54048 transitions. [2024-11-08 12:23:49,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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-11-08 12:23:49,367 INFO L276 IsEmpty]: Start isEmpty. Operand 36118 states and 54048 transitions. [2024-11-08 12:23:49,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 12:23:49,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:49,372 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:49,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 12:23:49,373 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:49,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:49,373 INFO L85 PathProgramCache]: Analyzing trace with hash -775506488, now seen corresponding path program 1 times [2024-11-08 12:23:49,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:49,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743154791] [2024-11-08 12:23:49,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:49,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:49,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:49,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:49,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743154791] [2024-11-08 12:23:49,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743154791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:49,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:49,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:23:49,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337149758] [2024-11-08 12:23:49,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:49,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:23:49,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:49,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:23:49,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:23:49,584 INFO L87 Difference]: Start difference. First operand 36118 states and 54048 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 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-11-08 12:23:49,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:49,984 INFO L93 Difference]: Finished difference Result 70962 states and 106659 transitions. [2024-11-08 12:23:49,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:23:49,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 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) Word has length 121 [2024-11-08 12:23:49,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:50,033 INFO L225 Difference]: With dead ends: 70962 [2024-11-08 12:23:50,034 INFO L226 Difference]: Without dead ends: 36118 [2024-11-08 12:23:50,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 12:23:50,053 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 819 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:50,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 341 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 12:23:50,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36118 states. [2024-11-08 12:23:50,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36118 to 36118. [2024-11-08 12:23:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36118 states, 36117 states have (on average 1.4842318021984107) internal successors, (53606), 36117 states have internal predecessors, (53606), 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-11-08 12:23:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36118 states to 36118 states and 53606 transitions. [2024-11-08 12:23:50,927 INFO L78 Accepts]: Start accepts. Automaton has 36118 states and 53606 transitions. Word has length 121 [2024-11-08 12:23:50,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:50,927 INFO L471 AbstractCegarLoop]: Abstraction has 36118 states and 53606 transitions. [2024-11-08 12:23:50,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 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-11-08 12:23:50,928 INFO L276 IsEmpty]: Start isEmpty. Operand 36118 states and 53606 transitions. [2024-11-08 12:23:50,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 12:23:50,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:50,930 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:50,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 12:23:50,930 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:50,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:50,931 INFO L85 PathProgramCache]: Analyzing trace with hash 302450541, now seen corresponding path program 1 times [2024-11-08 12:23:50,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:50,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016992173] [2024-11-08 12:23:50,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:50,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:53,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:23:53,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:53,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016992173] [2024-11-08 12:23:53,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016992173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:53,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:53,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-08 12:23:53,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496670463] [2024-11-08 12:23:53,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:53,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 12:23:53,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:53,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 12:23:53,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2024-11-08 12:23:53,780 INFO L87 Difference]: Start difference. First operand 36118 states and 53606 transitions. Second operand has 21 states, 21 states have (on average 5.761904761904762) internal successors, (121), 21 states have internal predecessors, (121), 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-11-08 12:24:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:24:00,276 INFO L93 Difference]: Finished difference Result 102796 states and 153828 transitions. [2024-11-08 12:24:00,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-08 12:24:00,277 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.761904761904762) internal successors, (121), 21 states have internal predecessors, (121), 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) Word has length 121 [2024-11-08 12:24:00,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:24:00,416 INFO L225 Difference]: With dead ends: 102796 [2024-11-08 12:24:00,416 INFO L226 Difference]: Without dead ends: 87616 [2024-11-08 12:24:00,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2024-11-08 12:24:00,446 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 1907 mSDsluCounter, 6536 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1907 SdHoareTripleChecker+Valid, 7123 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 12:24:00,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1907 Valid, 7123 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2215 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 12:24:00,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87616 states. [2024-11-08 12:24:01,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87616 to 36672. [2024-11-08 12:24:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36672 states, 36671 states have (on average 1.4791797333042458) internal successors, (54243), 36671 states have internal predecessors, (54243), 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-11-08 12:24:01,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36672 states to 36672 states and 54243 transitions. [2024-11-08 12:24:01,966 INFO L78 Accepts]: Start accepts. Automaton has 36672 states and 54243 transitions. Word has length 121 [2024-11-08 12:24:01,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:24:01,967 INFO L471 AbstractCegarLoop]: Abstraction has 36672 states and 54243 transitions. [2024-11-08 12:24:01,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.761904761904762) internal successors, (121), 21 states have internal predecessors, (121), 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-11-08 12:24:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand 36672 states and 54243 transitions. [2024-11-08 12:24:01,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 12:24:01,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:24:01,972 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:24:01,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 12:24:01,973 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:24:01,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:24:01,973 INFO L85 PathProgramCache]: Analyzing trace with hash -590053851, now seen corresponding path program 1 times [2024-11-08 12:24:01,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:24:01,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830587497] [2024-11-08 12:24:01,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:24:01,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:24:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:24:02,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:24:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:24:02,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:24:02,370 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:24:02,371 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 12:24:02,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 12:24:02,379 INFO L407 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, 1, 1, 1, 1, 1, 1] [2024-11-08 12:24:02,599 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 12:24:02,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 12:24:02 BoogieIcfgContainer [2024-11-08 12:24:02,603 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 12:24:02,604 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 12:24:02,604 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 12:24:02,604 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 12:24:02,605 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:23:16" (3/4) ... [2024-11-08 12:24:02,606 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 12:24:02,836 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4b8d677-308d-40a9-b239-0a125fd9b5db/bin/uautomizer-verify-jihMAELWvX/witness.graphml [2024-11-08 12:24:02,837 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 12:24:02,838 INFO L158 Benchmark]: Toolchain (without parser) took 49126.68ms. Allocated memory was 161.5MB in the beginning and 13.7GB in the end (delta: 13.5GB). Free memory was 122.2MB in the beginning and 12.0GB in the end (delta: -11.9GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-11-08 12:24:02,838 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 161.5MB. Free memory was 105.7MB in the beginning and 105.5MB in the end (delta: 241.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:24:02,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 723.09ms. Allocated memory is still 161.5MB. Free memory was 122.2MB in the beginning and 93.5MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 12:24:02,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.27ms. Allocated memory is still 161.5MB. Free memory was 93.5MB in the beginning and 88.1MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 12:24:02,839 INFO L158 Benchmark]: Boogie Preprocessor took 135.72ms. Allocated memory is still 161.5MB. Free memory was 88.1MB in the beginning and 83.1MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 12:24:02,839 INFO L158 Benchmark]: RCFGBuilder took 1614.36ms. Allocated memory was 161.5MB in the beginning and 222.3MB in the end (delta: 60.8MB). Free memory was 83.1MB in the beginning and 135.7MB in the end (delta: -52.7MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. [2024-11-08 12:24:02,840 INFO L158 Benchmark]: TraceAbstraction took 46320.73ms. Allocated memory was 222.3MB in the beginning and 13.7GB in the end (delta: 13.5GB). Free memory was 134.7MB in the beginning and 12.0GB in the end (delta: -11.9GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-08 12:24:02,840 INFO L158 Benchmark]: Witness Printer took 232.96ms. Allocated memory is still 13.7GB. Free memory was 12.0GB in the beginning and 12.0GB in the end (delta: 38.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-08 12:24:02,841 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.37ms. Allocated memory is still 161.5MB. Free memory was 105.7MB in the beginning and 105.5MB in the end (delta: 241.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 723.09ms. Allocated memory is still 161.5MB. Free memory was 122.2MB in the beginning and 93.5MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.27ms. Allocated memory is still 161.5MB. Free memory was 93.5MB in the beginning and 88.1MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 135.72ms. Allocated memory is still 161.5MB. Free memory was 88.1MB in the beginning and 83.1MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1614.36ms. Allocated memory was 161.5MB in the beginning and 222.3MB in the end (delta: 60.8MB). Free memory was 83.1MB in the beginning and 135.7MB in the end (delta: -52.7MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. * TraceAbstraction took 46320.73ms. Allocated memory was 222.3MB in the beginning and 13.7GB in the end (delta: 13.5GB). Free memory was 134.7MB in the beginning and 12.0GB in the end (delta: -11.9GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 232.96ms. Allocated memory is still 13.7GB. Free memory was 12.0GB in the beginning and 12.0GB in the end (delta: 38.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 586]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L25] msg_t nomsg = (msg_t )-1; [L26] port_t p12 = 0; [L27] char p12_old = '\x0'; [L28] char p12_new = '\x0'; [L29] _Bool ep12 = 0; [L30] port_t p13 = 0; [L31] char p13_old = '\x0'; [L32] char p13_new = '\x0'; [L33] _Bool ep13 = 0; [L34] port_t p21 = 0; [L35] char p21_old = '\x0'; [L36] char p21_new = '\x0'; [L37] _Bool ep21 = 0; [L38] port_t p23 = 0; [L39] char p23_old = '\x0'; [L40] char p23_new = '\x0'; [L41] _Bool ep23 = 0; [L42] port_t p31 = 0; [L43] char p31_old = '\x0'; [L44] char p31_new = '\x0'; [L45] _Bool ep31 = 0; [L46] port_t p32 = 0; [L47] char p32_old = '\x0'; [L48] char p32_new = '\x0'; [L49] _Bool ep32 = 0; [L50] char id1 = '\x0'; [L51] char r1 = '\x0'; [L52] char st1 = '\x0'; [L53] char nl1 = '\x0'; [L54] char m1 = '\x0'; [L55] char max1 = '\x0'; [L56] _Bool mode1 = 0; [L57] _Bool newmax1 = 0; [L58] char id2 = '\x0'; [L59] char r2 = '\x0'; [L60] char st2 = '\x0'; [L61] char nl2 = '\x0'; [L62] char m2 = '\x0'; [L63] char max2 = '\x0'; [L64] _Bool mode2 = 0; [L65] _Bool newmax2 = 0; [L66] char id3 = '\x0'; [L67] char r3 = '\x0'; [L68] char st3 = '\x0'; [L69] char nl3 = '\x0'; [L70] char m3 = '\x0'; [L71] char max3 = '\x0'; [L72] _Bool mode3 = 0; [L73] _Bool newmax3 = 0; [L77] void (*nodes[3])() = { &node1, &node2, &node3 }; [L81] int __return_1237; [L82] int __return_1383; [L83] int __return_1517; [L84] int __tmp_1518_0; [L85] int __return_1641; [L86] int __return_1531; VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=0, id3=0, m1=0, m2=0, m3=0, max1=0, max2=0, max3=0, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L89] int main__c1; [L90] int main__i2; [L91] main__c1 = 0 [L92] ep12 = __VERIFIER_nondet_bool() [L93] ep13 = __VERIFIER_nondet_bool() [L94] ep21 = __VERIFIER_nondet_bool() [L95] ep23 = __VERIFIER_nondet_bool() [L96] ep31 = __VERIFIER_nondet_bool() [L97] ep32 = __VERIFIER_nondet_bool() [L98] id1 = __VERIFIER_nondet_char() [L99] r1 = __VERIFIER_nondet_char() [L100] st1 = __VERIFIER_nondet_char() [L101] nl1 = __VERIFIER_nondet_char() [L102] m1 = __VERIFIER_nondet_char() [L103] max1 = __VERIFIER_nondet_char() [L104] mode1 = __VERIFIER_nondet_bool() [L105] newmax1 = __VERIFIER_nondet_bool() [L106] id2 = __VERIFIER_nondet_char() [L107] r2 = __VERIFIER_nondet_char() [L108] st2 = __VERIFIER_nondet_char() [L109] nl2 = __VERIFIER_nondet_char() [L110] m2 = __VERIFIER_nondet_char() [L111] max2 = __VERIFIER_nondet_char() [L112] mode2 = __VERIFIER_nondet_bool() [L113] newmax2 = __VERIFIER_nondet_bool() [L114] id3 = __VERIFIER_nondet_char() [L115] r3 = __VERIFIER_nondet_char() [L116] st3 = __VERIFIER_nondet_char() [L117] nl3 = __VERIFIER_nondet_char() [L118] m3 = __VERIFIER_nondet_char() [L119] max3 = __VERIFIER_nondet_char() [L120] mode3 = __VERIFIER_nondet_bool() [L121] newmax3 = __VERIFIER_nondet_bool() [L123] _Bool init__r121; [L124] _Bool init__r131; [L125] _Bool init__r211; [L126] _Bool init__r231; [L127] _Bool init__r311; [L128] _Bool init__r321; [L129] _Bool init__r122; [L130] int init__tmp; [L131] _Bool init__r132; [L132] int init__tmp___0; [L133] _Bool init__r212; [L134] int init__tmp___1; [L135] _Bool init__r232; [L136] int init__tmp___2; [L137] _Bool init__r312; [L138] int init__tmp___3; [L139] _Bool init__r322; [L140] int init__tmp___4; [L141] int init__tmp___5; [L142] init__r121 = ep12 [L143] init__r131 = ep13 [L144] init__r211 = ep21 [L145] init__r231 = ep23 [L146] init__r311 = ep31 [L147] init__r321 = ep32 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L148] COND FALSE !(!(init__r121 == 0)) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1778] COND TRUE !(init__r131 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1780] COND TRUE !(ep32 == 0) [L1782] init__tmp = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, init__tmp=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L152] init__r122 = (_Bool)init__tmp VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L153] COND TRUE !(init__r131 == 0) [L155] init__tmp___0 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, init__tmp___0=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L157] init__r132 = (_Bool)init__tmp___0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L158] COND TRUE !(init__r211 == 0) [L160] init__tmp___1 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, init__tmp___1=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L162] init__r212 = (_Bool)init__tmp___1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r212=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L163] COND FALSE !(!(init__r231 == 0)) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r212=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1709] COND TRUE !(init__r211 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1711] COND TRUE !(ep13 == 0) [L1713] init__tmp___2 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r311=0, init__r321=1, init__tmp___2=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L167] init__r232 = (_Bool)init__tmp___2 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L168] COND FALSE !(!(init__r311 == 0)) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1686] COND TRUE !(init__r321 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1688] COND TRUE !(ep21 == 0) [L1690] init__tmp___3 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, init__tmp___3=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L172] init__r312 = (_Bool)init__tmp___3 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L173] COND TRUE !(init__r321 == 0) [L175] init__tmp___4 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__tmp___4=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L177] init__r322 = (_Bool)init__tmp___4 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L178] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L180] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L182] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L184] COND TRUE ((int)id1) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L186] COND TRUE ((int)id2) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L188] COND TRUE ((int)id3) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L190] COND TRUE ((int)r1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L192] COND TRUE ((int)r2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L194] COND TRUE ((int)r3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L196] COND TRUE !(init__r122 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L198] COND TRUE !(init__r132 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L200] COND TRUE !(init__r212 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L202] COND TRUE !(init__r232 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L204] COND TRUE !(init__r312 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L206] COND TRUE !(init__r322 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L208] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L210] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L212] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L214] COND TRUE ((int)st1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L216] COND TRUE ((int)st2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L218] COND TRUE ((int)st3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L220] COND TRUE ((int)nl1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L222] COND TRUE ((int)nl2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L224] COND TRUE ((int)nl3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L226] COND TRUE ((int)mode1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L228] COND TRUE ((int)mode2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L230] COND TRUE ((int)mode3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L232] COND TRUE !(newmax1 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L234] COND TRUE !(newmax2 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L236] COND TRUE !(newmax3 == 0) [L238] init__tmp___5 = 1 [L239] __return_1237 = init__tmp___5 [L240] main__i2 = __return_1237 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L241] COND TRUE main__i2 != 0 [L243] p12_old = nomsg [L244] p12_new = nomsg [L245] p13_old = nomsg [L246] p13_new = nomsg [L247] p21_old = nomsg [L248] p21_new = nomsg [L249] p23_old = nomsg [L250] p23_new = nomsg [L251] p31_old = nomsg [L252] p31_new = nomsg [L253] p32_old = nomsg [L254] p32_new = nomsg [L255] main__i2 = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L256] COND TRUE main__i2 < 6 [L259] _Bool node1__newmax; [L260] node1__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L261] COND FALSE !(!(mode1 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L267] COND TRUE ((int)r1) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L269] COND FALSE !(!(ep12 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L282] COND TRUE !(ep13 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L284] COND TRUE !(newmax1 == 0) [L286] int node1____CPAchecker_TMP_1; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L287] COND TRUE max1 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L289] COND TRUE p13_new == nomsg [L291] node1____CPAchecker_TMP_1 = max1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_1=127, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L293] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L295] mode1 = 1 [L297] _Bool node2__newmax; [L298] node2__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L299] COND FALSE !(!(mode2 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L305] COND TRUE ((int)r2) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L307] COND TRUE !(ep21 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L309] COND TRUE !(newmax2 == 0) [L311] int node2____CPAchecker_TMP_0; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L312] COND TRUE max2 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L314] COND TRUE p21_new == nomsg [L316] node2____CPAchecker_TMP_0 = max2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2____CPAchecker_TMP_0=5, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L318] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L320] COND FALSE !(!(ep23 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L333] mode2 = 1 [L335] _Bool node3__newmax; [L336] node3__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L337] COND FALSE !(!(mode3 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L343] COND TRUE ((int)r3) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L345] COND FALSE !(!(ep31 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L358] COND TRUE !(ep32 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L360] COND TRUE !(newmax3 == 0) [L362] int node3____CPAchecker_TMP_1; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L363] COND TRUE max3 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L365] COND TRUE p32_new == nomsg [L367] node3____CPAchecker_TMP_1 = max3 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node3____CPAchecker_TMP_1=4, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L369] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=4, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L371] mode3 = 1 [L372] p12_old = p12_new [L373] p12_new = nomsg [L374] p13_old = p13_new [L375] p13_new = nomsg [L376] p21_old = p21_new [L377] p21_new = nomsg [L378] p23_old = p23_new [L379] p23_new = nomsg [L380] p31_old = p31_new [L381] p31_new = nomsg [L382] p32_old = p32_new [L383] p32_new = nomsg [L385] int check__tmp; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L386] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L388] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L390] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L392] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L394] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L400] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L402] COND TRUE ((int)r1) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L404] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L410] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L412] COND TRUE ((int)r1) < 2 [L414] check__tmp = 1 [L415] __return_1383 = check__tmp [L416] main__c1 = __return_1383 [L418] _Bool __tmp_1; [L419] __tmp_1 = main__c1 [L420] _Bool assert__arg; [L421] assert__arg = __tmp_1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, assert__arg=1, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L422] COND FALSE !(assert__arg == 0) [L428] int main____CPAchecker_TMP_0 = main__i2; [L429] main__i2 = main__i2 + 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L430] COND TRUE main__i2 < 6 [L433] _Bool node1__newmax; [L434] node1__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L435] COND TRUE !(mode1 == 0) [L437] r1 = (char)(((int)r1) + 1) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L438] COND TRUE !(ep21 == 0) [L440] m1 = p21_old [L441] p21_old = nomsg VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L447] COND FALSE !(!(ep31 == 0)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L456] newmax1 = node1__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L457] COND TRUE ((int)r1) == 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L459] COND TRUE ((int)max1) == ((int)id1) [L461] st1 = 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L463] mode1 = 0 [L465] _Bool node2__newmax; [L466] node2__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L467] COND TRUE !(mode2 == 0) [L469] r2 = (char)(((int)r2) + 1) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L470] COND FALSE !(!(ep12 == 0)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L479] COND TRUE !(ep32 == 0) [L481] m2 = p32_old [L482] p32_old = nomsg VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L483] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L488] newmax2 = node2__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L489] COND FALSE !(((int)r2) == 2) [L495] mode2 = 0 [L497] _Bool node3__newmax; [L498] node3__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L499] COND TRUE !(mode3 == 0) [L501] r3 = (char)(((int)r3) + 1) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L502] COND TRUE !(ep13 == 0) [L504] m3 = p13_old [L505] p13_old = nomsg VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L506] COND TRUE ((int)m3) > ((int)max3) [L508] max3 = m3 [L509] node3__newmax = 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L511] COND FALSE !(!(ep23 == 0)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L520] newmax3 = node3__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L521] COND FALSE !(((int)r3) == 2) [L527] mode3 = 0 [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L541] int check__tmp; VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L542] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L544] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L546] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L548] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L550] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L556] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1181] check__tmp = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, check__tmp=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L574] __return_1517 = check__tmp [L575] main__c1 = __return_1517 [L576] __tmp_1518_0 = main____CPAchecker_TMP_0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main__c1=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L578] main____CPAchecker_TMP_0 = __tmp_1518_0 [L580] _Bool __tmp_2; [L581] __tmp_2 = main__c1 [L582] _Bool assert__arg; [L583] assert__arg = __tmp_2 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, assert__arg=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L584] COND TRUE assert__arg == 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L586] reach_error() VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 241 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.0s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10759 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10759 mSDsluCounter, 31531 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18746 mSDsCounter, 177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2893 IncrementalHoareTripleChecker+Invalid, 3070 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 177 mSolverCounterUnsat, 12785 mSDtfsCounter, 2893 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42173occurred in iteration=18, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.9s AutomataMinimizationTime, 28 MinimizatonAttempts, 96554 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 3218 NumberOfCodeBlocks, 3218 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 3069 ConstructedInterpolants, 0 QuantifiedInterpolants, 11495 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-08 12:24:02,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4b8d677-308d-40a9-b239-0a125fd9b5db/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE