./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 527bcce2 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_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx --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 906036225f588312d23f50dd6f109319810cf1ead43ce885e134bcc5a0be0190 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:15:10,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:15:10,385 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-21 22:15:10,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:15:10,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:15:10,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:15:10,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:15:10,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:15:10,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:15:10,446 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:15:10,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:15:10,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:15:10,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:15:10,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:15:10,452 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:15:10,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:15:10,453 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:15:10,453 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:15:10,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:15:10,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:15:10,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:15:10,456 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:15:10,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:15:10,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:15:10,457 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:15:10,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:15:10,458 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:15:10,459 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:15:10,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:15:10,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:15:10,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:15:10,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:15:10,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:15:10,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:15:10,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:15:10,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:15:10,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:15:10,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:15:10,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:15:10,464 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:15:10,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:15:10,465 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:15:10,465 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_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/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_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx 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 -> 906036225f588312d23f50dd6f109319810cf1ead43ce885e134bcc5a0be0190 [2023-11-21 22:15:10,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:15:10,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:15:10,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:15:10,864 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:15:10,865 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:15:10,867 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2023-11-21 22:15:14,131 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:15:14,439 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:15:14,440 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2023-11-21 22:15:14,459 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/data/35e289a61/da8bd1edaaad437e900cef6508a92eb8/FLAG7f4ae098b [2023-11-21 22:15:14,474 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/data/35e289a61/da8bd1edaaad437e900cef6508a92eb8 [2023-11-21 22:15:14,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:15:14,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:15:14,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:15:14,480 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:15:14,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:15:14,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:15:14" (1/1) ... [2023-11-21 22:15:14,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6acde7b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:14, skipping insertion in model container [2023-11-21 22:15:14,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:15:14" (1/1) ... [2023-11-21 22:15:14,561 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:15:14,820 WARN L240 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_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c[14682,14695] [2023-11-21 22:15:14,830 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:15:14,843 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:15:14,924 WARN L240 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_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c[14682,14695] [2023-11-21 22:15:14,925 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:15:14,950 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:15:14,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:14 WrapperNode [2023-11-21 22:15:14,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:15:14,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:15:14,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:15:14,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:15:14,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:14" (1/1) ... [2023-11-21 22:15:14,979 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:14" (1/1) ... [2023-11-21 22:15:15,055 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 497 [2023-11-21 22:15:15,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:15:15,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:15:15,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:15:15,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:15:15,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:14" (1/1) ... [2023-11-21 22:15:15,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:14" (1/1) ... [2023-11-21 22:15:15,076 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:14" (1/1) ... [2023-11-21 22:15:15,107 INFO L187 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-21 22:15:15,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:14" (1/1) ... [2023-11-21 22:15:15,109 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:14" (1/1) ... [2023-11-21 22:15:15,141 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:14" (1/1) ... [2023-11-21 22:15:15,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:14" (1/1) ... [2023-11-21 22:15:15,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:14" (1/1) ... [2023-11-21 22:15:15,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:14" (1/1) ... [2023-11-21 22:15:15,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:15:15,163 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:15:15,163 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:15:15,164 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:15:15,165 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:14" (1/1) ... [2023-11-21 22:15:15,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:15:15,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:15,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:15,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:15:15,273 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2023-11-21 22:15:15,274 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2023-11-21 22:15:15,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:15:15,275 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2023-11-21 22:15:15,276 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2023-11-21 22:15:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2023-11-21 22:15:15,276 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2023-11-21 22:15:15,278 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2023-11-21 22:15:15,279 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2023-11-21 22:15:15,279 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-21 22:15:15,280 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-21 22:15:15,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 22:15:15,280 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2023-11-21 22:15:15,280 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2023-11-21 22:15:15,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:15:15,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:15:15,281 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2023-11-21 22:15:15,281 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2023-11-21 22:15:15,457 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:15:15,460 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:15:16,193 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:15:16,476 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:15:16,476 INFO L308 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-21 22:15:16,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:15:16 BoogieIcfgContainer [2023-11-21 22:15:16,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:15:16,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:15:16,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:15:16,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:15:16,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:15:14" (1/3) ... [2023-11-21 22:15:16,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6215c24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:15:16, skipping insertion in model container [2023-11-21 22:15:16,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:14" (2/3) ... [2023-11-21 22:15:16,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6215c24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:15:16, skipping insertion in model container [2023-11-21 22:15:16,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:15:16" (3/3) ... [2023-11-21 22:15:16,494 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2023-11-21 22:15:16,513 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:15:16,513 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-21 22:15:16,574 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:15:16,580 INFO L357 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, mHoare=true, 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;@70a085f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:15:16,580 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 22:15:16,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 109 states have (on average 1.5412844036697249) internal successors, (168), 111 states have internal predecessors, (168), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-21 22:15:16,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-21 22:15:16,591 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:15:16,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:16,592 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:15:16,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:16,597 INFO L85 PathProgramCache]: Analyzing trace with hash 563549731, now seen corresponding path program 1 times [2023-11-21 22:15:16,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:16,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941658326] [2023-11-21 22:15:16,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:16,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:17,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:15:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:17,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:15:17,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:17,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941658326] [2023-11-21 22:15:17,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941658326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:17,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:17,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:15:17,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663842113] [2023-11-21 22:15:17,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:17,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:15:17,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:17,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:15:17,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:15:17,252 INFO L87 Difference]: Start difference. First operand has 149 states, 109 states have (on average 1.5412844036697249) internal successors, (168), 111 states have internal predecessors, (168), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-21 22:15:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:17,457 INFO L93 Difference]: Finished difference Result 298 states and 487 transitions. [2023-11-21 22:15:17,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:15:17,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-11-21 22:15:17,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:15:17,473 INFO L225 Difference]: With dead ends: 298 [2023-11-21 22:15:17,474 INFO L226 Difference]: Without dead ends: 152 [2023-11-21 22:15:17,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:15:17,489 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 5 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:15:17,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 635 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:15:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-21 22:15:17,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2023-11-21 22:15:17,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 112 states have (on average 1.5089285714285714) internal successors, (169), 113 states have internal predecessors, (169), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-21 22:15:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2023-11-21 22:15:17,579 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 19 [2023-11-21 22:15:17,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:15:17,579 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2023-11-21 22:15:17,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-21 22:15:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2023-11-21 22:15:17,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-21 22:15:17,583 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:15:17,583 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:17,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:15:17,584 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:15:17,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:17,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1882593775, now seen corresponding path program 1 times [2023-11-21 22:15:17,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:17,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283686067] [2023-11-21 22:15:17,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:17,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:17,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:15:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:17,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-21 22:15:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:17,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 22:15:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:17,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 22:15:17,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:17,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283686067] [2023-11-21 22:15:17,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283686067] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:17,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:17,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:15:17,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797081121] [2023-11-21 22:15:17,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:17,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:15:17,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:17,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:15:17,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:15:17,818 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 22:15:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:17,987 INFO L93 Difference]: Finished difference Result 337 states and 512 transitions. [2023-11-21 22:15:17,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:15:17,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2023-11-21 22:15:17,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:15:17,990 INFO L225 Difference]: With dead ends: 337 [2023-11-21 22:15:17,990 INFO L226 Difference]: Without dead ends: 188 [2023-11-21 22:15:17,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:15:17,993 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 325 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:15:17,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 572 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:15:17,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-11-21 22:15:18,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2023-11-21 22:15:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 141 states have (on average 1.5106382978723405) internal successors, (213), 141 states have internal predecessors, (213), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-21 22:15:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 281 transitions. [2023-11-21 22:15:18,053 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 281 transitions. Word has length 30 [2023-11-21 22:15:18,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:15:18,054 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 281 transitions. [2023-11-21 22:15:18,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 22:15:18,055 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 281 transitions. [2023-11-21 22:15:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-21 22:15:18,056 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:15:18,056 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:18,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:15:18,057 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:15:18,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:18,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1995629030, now seen corresponding path program 1 times [2023-11-21 22:15:18,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:18,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298048128] [2023-11-21 22:15:18,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:18,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:18,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:15:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:18,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-21 22:15:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:18,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-21 22:15:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 22:15:18,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:18,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298048128] [2023-11-21 22:15:18,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298048128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:18,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:18,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:15:18,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297007452] [2023-11-21 22:15:18,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:18,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:15:18,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:18,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:15:18,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:15:18,342 INFO L87 Difference]: Start difference. First operand 186 states and 281 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 22:15:18,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:18,521 INFO L93 Difference]: Finished difference Result 337 states and 510 transitions. [2023-11-21 22:15:18,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:15:18,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2023-11-21 22:15:18,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:15:18,524 INFO L225 Difference]: With dead ends: 337 [2023-11-21 22:15:18,524 INFO L226 Difference]: Without dead ends: 188 [2023-11-21 22:15:18,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:15:18,526 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 321 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:15:18,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 575 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:15:18,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-11-21 22:15:18,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2023-11-21 22:15:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 141 states have (on average 1.50354609929078) internal successors, (212), 141 states have internal predecessors, (212), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-21 22:15:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 280 transitions. [2023-11-21 22:15:18,549 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 280 transitions. Word has length 31 [2023-11-21 22:15:18,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:15:18,550 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 280 transitions. [2023-11-21 22:15:18,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 22:15:18,550 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 280 transitions. [2023-11-21 22:15:18,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-21 22:15:18,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:15:18,552 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:18,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 22:15:18,552 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:15:18,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:18,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2323855, now seen corresponding path program 1 times [2023-11-21 22:15:18,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:18,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515685707] [2023-11-21 22:15:18,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:18,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:18,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:15:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:18,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-21 22:15:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:18,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-21 22:15:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:18,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 22:15:18,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:18,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515685707] [2023-11-21 22:15:18,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515685707] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:18,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:18,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:15:18,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364562089] [2023-11-21 22:15:18,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:18,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:15:18,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:18,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:15:18,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:15:18,756 INFO L87 Difference]: Start difference. First operand 186 states and 280 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-21 22:15:18,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:18,848 INFO L93 Difference]: Finished difference Result 340 states and 514 transitions. [2023-11-21 22:15:18,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:15:18,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2023-11-21 22:15:18,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:15:18,853 INFO L225 Difference]: With dead ends: 340 [2023-11-21 22:15:18,854 INFO L226 Difference]: Without dead ends: 191 [2023-11-21 22:15:18,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:15:18,865 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 6 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 22:15:18,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 647 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 22:15:18,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-11-21 22:15:18,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2023-11-21 22:15:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 145 states have (on average 1.4896551724137932) internal successors, (216), 145 states have internal predecessors, (216), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-21 22:15:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 284 transitions. [2023-11-21 22:15:18,892 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 284 transitions. Word has length 33 [2023-11-21 22:15:18,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:15:18,893 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 284 transitions. [2023-11-21 22:15:18,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-21 22:15:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 284 transitions. [2023-11-21 22:15:18,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-21 22:15:18,899 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:15:18,900 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:18,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 22:15:18,901 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:15:18,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:18,903 INFO L85 PathProgramCache]: Analyzing trace with hash -708088937, now seen corresponding path program 1 times [2023-11-21 22:15:18,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:18,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487123408] [2023-11-21 22:15:18,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:18,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:19,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:15:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:19,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-21 22:15:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:19,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-21 22:15:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:19,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-21 22:15:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:19,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 22:15:19,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:19,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487123408] [2023-11-21 22:15:19,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487123408] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:19,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:19,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:15:19,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141041884] [2023-11-21 22:15:19,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:19,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:15:19,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:19,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:15:19,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:15:19,195 INFO L87 Difference]: Start difference. First operand 191 states and 284 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-21 22:15:19,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:19,280 INFO L93 Difference]: Finished difference Result 350 states and 525 transitions. [2023-11-21 22:15:19,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:15:19,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2023-11-21 22:15:19,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:15:19,284 INFO L225 Difference]: With dead ends: 350 [2023-11-21 22:15:19,286 INFO L226 Difference]: Without dead ends: 196 [2023-11-21 22:15:19,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:15:19,294 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 6 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 22:15:19,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 633 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 22:15:19,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-11-21 22:15:19,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2023-11-21 22:15:19,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 149 states have (on average 1.476510067114094) internal successors, (220), 149 states have internal predecessors, (220), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-21 22:15:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 288 transitions. [2023-11-21 22:15:19,335 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 288 transitions. Word has length 41 [2023-11-21 22:15:19,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:15:19,339 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 288 transitions. [2023-11-21 22:15:19,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-21 22:15:19,339 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 288 transitions. [2023-11-21 22:15:19,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-21 22:15:19,343 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:15:19,343 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:19,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 22:15:19,344 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:15:19,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:19,345 INFO L85 PathProgramCache]: Analyzing trace with hash -864154271, now seen corresponding path program 1 times [2023-11-21 22:15:19,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:19,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961474594] [2023-11-21 22:15:19,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:19,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:19,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:15:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:19,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-21 22:15:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:19,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-21 22:15:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:19,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-21 22:15:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:19,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-21 22:15:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 22:15:19,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:19,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961474594] [2023-11-21 22:15:19,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961474594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:19,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:19,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:15:19,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398267861] [2023-11-21 22:15:19,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:19,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:15:19,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:19,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:15:19,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:15:19,571 INFO L87 Difference]: Start difference. First operand 196 states and 288 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-21 22:15:19,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:19,643 INFO L93 Difference]: Finished difference Result 359 states and 529 transitions. [2023-11-21 22:15:19,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:15:19,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 49 [2023-11-21 22:15:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:15:19,646 INFO L225 Difference]: With dead ends: 359 [2023-11-21 22:15:19,646 INFO L226 Difference]: Without dead ends: 200 [2023-11-21 22:15:19,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:15:19,649 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 5 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 22:15:19,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 642 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 22:15:19,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-11-21 22:15:19,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2023-11-21 22:15:19,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 152 states have internal predecessors, (223), 34 states have call successors, (34), 13 states have call predecessors, (34), 13 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-21 22:15:19,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 291 transitions. [2023-11-21 22:15:19,671 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 291 transitions. Word has length 49 [2023-11-21 22:15:19,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:15:19,671 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 291 transitions. [2023-11-21 22:15:19,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-21 22:15:19,671 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 291 transitions. [2023-11-21 22:15:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-21 22:15:19,673 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:15:19,673 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:19,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 22:15:19,673 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:15:19,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:19,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1532305032, now seen corresponding path program 1 times [2023-11-21 22:15:19,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:19,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522071705] [2023-11-21 22:15:19,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:19,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:19,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:15:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:19,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-21 22:15:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:19,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-21 22:15:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:19,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-21 22:15:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:19,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-21 22:15:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:19,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 22:15:19,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:19,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522071705] [2023-11-21 22:15:19,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522071705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:19,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:19,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:15:19,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212415939] [2023-11-21 22:15:19,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:19,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:15:19,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:19,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:15:19,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:15:19,890 INFO L87 Difference]: Start difference. First operand 200 states and 291 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-21 22:15:19,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:19,963 INFO L93 Difference]: Finished difference Result 368 states and 539 transitions. [2023-11-21 22:15:19,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:15:19,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 49 [2023-11-21 22:15:19,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:15:19,967 INFO L225 Difference]: With dead ends: 368 [2023-11-21 22:15:19,968 INFO L226 Difference]: Without dead ends: 205 [2023-11-21 22:15:19,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:15:19,970 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 6 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 22:15:19,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 633 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 22:15:19,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-11-21 22:15:19,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2023-11-21 22:15:19,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 156 states have (on average 1.455128205128205) internal successors, (227), 156 states have internal predecessors, (227), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-21 22:15:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 295 transitions. [2023-11-21 22:15:19,991 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 295 transitions. Word has length 49 [2023-11-21 22:15:19,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:15:19,994 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 295 transitions. [2023-11-21 22:15:19,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-21 22:15:19,995 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 295 transitions. [2023-11-21 22:15:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-21 22:15:19,998 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:15:19,998 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:19,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 22:15:19,999 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:15:20,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:20,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1635203352, now seen corresponding path program 1 times [2023-11-21 22:15:20,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:20,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601294234] [2023-11-21 22:15:20,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:20,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:20,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:15:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:20,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-21 22:15:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:20,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-21 22:15:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:20,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-21 22:15:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:20,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-21 22:15:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:20,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-21 22:15:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-21 22:15:20,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:20,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601294234] [2023-11-21 22:15:20,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601294234] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:20,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:20,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:15:20,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668024998] [2023-11-21 22:15:20,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:20,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:15:20,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:20,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:15:20,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:15:20,259 INFO L87 Difference]: Start difference. First operand 205 states and 295 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-21 22:15:20,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:20,328 INFO L93 Difference]: Finished difference Result 379 states and 546 transitions. [2023-11-21 22:15:20,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:15:20,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2023-11-21 22:15:20,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:15:20,335 INFO L225 Difference]: With dead ends: 379 [2023-11-21 22:15:20,335 INFO L226 Difference]: Without dead ends: 211 [2023-11-21 22:15:20,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:15:20,337 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 7 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 22:15:20,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 644 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 22:15:20,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-11-21 22:15:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2023-11-21 22:15:20,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 161 states have (on average 1.4409937888198758) internal successors, (232), 161 states have internal predecessors, (232), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-21 22:15:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 300 transitions. [2023-11-21 22:15:20,361 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 300 transitions. Word has length 57 [2023-11-21 22:15:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:15:20,362 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 300 transitions. [2023-11-21 22:15:20,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-21 22:15:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 300 transitions. [2023-11-21 22:15:20,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-21 22:15:20,363 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:15:20,363 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:20,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 22:15:20,364 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:15:20,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:20,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1412769855, now seen corresponding path program 1 times [2023-11-21 22:15:20,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:20,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415441050] [2023-11-21 22:15:20,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:20,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:20,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:15:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:20,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-21 22:15:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:20,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-21 22:15:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:20,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-21 22:15:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:20,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-21 22:15:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:20,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-21 22:15:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:20,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-21 22:15:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:20,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 22:15:20,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:20,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415441050] [2023-11-21 22:15:20,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415441050] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:15:20,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262317198] [2023-11-21 22:15:20,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:20,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:15:20,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:20,964 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:15:20,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 22:15:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:21,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-21 22:15:21,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:15:21,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:15:21,922 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:15:22,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 22:15:22,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262317198] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:15:22,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:15:22,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-11-21 22:15:22,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894621066] [2023-11-21 22:15:22,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:15:22,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-21 22:15:22,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:22,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-21 22:15:22,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2023-11-21 22:15:22,059 INFO L87 Difference]: Start difference. First operand 211 states and 300 transitions. Second operand has 18 states, 13 states have (on average 6.461538461538462) internal successors, (84), 16 states have internal predecessors, (84), 6 states have call successors, (20), 3 states have call predecessors, (20), 8 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) [2023-11-21 22:15:22,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:22,908 INFO L93 Difference]: Finished difference Result 649 states and 938 transitions. [2023-11-21 22:15:22,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-21 22:15:22,909 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 6.461538461538462) internal successors, (84), 16 states have internal predecessors, (84), 6 states have call successors, (20), 3 states have call predecessors, (20), 8 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) Word has length 60 [2023-11-21 22:15:22,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:15:22,914 INFO L225 Difference]: With dead ends: 649 [2023-11-21 22:15:22,915 INFO L226 Difference]: Without dead ends: 475 [2023-11-21 22:15:22,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2023-11-21 22:15:22,917 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 496 mSDsluCounter, 2984 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 3199 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-21 22:15:22,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 3199 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-21 22:15:22,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2023-11-21 22:15:22,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 342. [2023-11-21 22:15:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 256 states have (on average 1.40625) internal successors, (360), 257 states have internal predecessors, (360), 58 states have call successors, (58), 27 states have call predecessors, (58), 27 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2023-11-21 22:15:22,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 476 transitions. [2023-11-21 22:15:22,953 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 476 transitions. Word has length 60 [2023-11-21 22:15:22,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:15:22,954 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 476 transitions. [2023-11-21 22:15:22,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 6.461538461538462) internal successors, (84), 16 states have internal predecessors, (84), 6 states have call successors, (20), 3 states have call predecessors, (20), 8 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) [2023-11-21 22:15:22,954 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 476 transitions. [2023-11-21 22:15:22,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-21 22:15:22,955 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:15:22,955 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:22,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:23,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-21 22:15:23,176 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:15:23,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:23,176 INFO L85 PathProgramCache]: Analyzing trace with hash 891754519, now seen corresponding path program 1 times [2023-11-21 22:15:23,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:23,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112181799] [2023-11-21 22:15:23,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:23,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:23,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:15:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:23,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-21 22:15:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:23,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-21 22:15:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:23,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-21 22:15:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:23,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-21 22:15:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:23,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-21 22:15:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:23,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-21 22:15:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:23,342 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-21 22:15:23,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:23,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112181799] [2023-11-21 22:15:23,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112181799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:23,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:23,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:15:23,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960239366] [2023-11-21 22:15:23,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:23,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:15:23,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:23,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:15:23,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:15:23,345 INFO L87 Difference]: Start difference. First operand 342 states and 476 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-21 22:15:23,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:23,423 INFO L93 Difference]: Finished difference Result 632 states and 880 transitions. [2023-11-21 22:15:23,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:15:23,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2023-11-21 22:15:23,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:15:23,427 INFO L225 Difference]: With dead ends: 632 [2023-11-21 22:15:23,427 INFO L226 Difference]: Without dead ends: 350 [2023-11-21 22:15:23,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:15:23,429 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 5 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 22:15:23,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 642 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 22:15:23,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2023-11-21 22:15:23,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2023-11-21 22:15:23,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 262 states have (on average 1.3969465648854962) internal successors, (366), 263 states have internal predecessors, (366), 58 states have call successors, (58), 29 states have call predecessors, (58), 29 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2023-11-21 22:15:23,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 482 transitions. [2023-11-21 22:15:23,460 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 482 transitions. Word has length 64 [2023-11-21 22:15:23,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:15:23,461 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 482 transitions. [2023-11-21 22:15:23,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-21 22:15:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 482 transitions. [2023-11-21 22:15:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-21 22:15:23,462 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:15:23,462 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:23,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 22:15:23,463 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:15:23,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:23,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1132789952, now seen corresponding path program 1 times [2023-11-21 22:15:23,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:23,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118219693] [2023-11-21 22:15:23,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:23,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:23,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:15:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:23,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-21 22:15:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:23,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-21 22:15:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:23,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-21 22:15:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:23,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-21 22:15:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:23,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-21 22:15:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:23,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-21 22:15:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:23,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-21 22:15:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:23,809 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-21 22:15:23,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:23,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118219693] [2023-11-21 22:15:23,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118219693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:23,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:23,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-21 22:15:23,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423578687] [2023-11-21 22:15:23,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:23,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-21 22:15:23,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:23,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-21 22:15:23,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-21 22:15:23,812 INFO L87 Difference]: Start difference. First operand 350 states and 482 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-21 22:15:24,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:24,475 INFO L93 Difference]: Finished difference Result 1128 states and 1579 transitions. [2023-11-21 22:15:24,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 22:15:24,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 69 [2023-11-21 22:15:24,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:15:24,483 INFO L225 Difference]: With dead ends: 1128 [2023-11-21 22:15:24,483 INFO L226 Difference]: Without dead ends: 834 [2023-11-21 22:15:24,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-11-21 22:15:24,485 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 719 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-21 22:15:24,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1235 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-21 22:15:24,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2023-11-21 22:15:24,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 647. [2023-11-21 22:15:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 479 states have (on average 1.3674321503131524) internal successors, (655), 482 states have internal predecessors, (655), 109 states have call successors, (109), 58 states have call predecessors, (109), 58 states have return successors, (109), 106 states have call predecessors, (109), 109 states have call successors, (109) [2023-11-21 22:15:24,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 873 transitions. [2023-11-21 22:15:24,575 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 873 transitions. Word has length 69 [2023-11-21 22:15:24,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:15:24,575 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 873 transitions. [2023-11-21 22:15:24,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-21 22:15:24,576 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 873 transitions. [2023-11-21 22:15:24,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-21 22:15:24,577 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:15:24,577 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:24,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 22:15:24,578 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:15:24,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:24,578 INFO L85 PathProgramCache]: Analyzing trace with hash 926227953, now seen corresponding path program 1 times [2023-11-21 22:15:24,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:24,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582841738] [2023-11-21 22:15:24,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:24,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:24,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:15:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:24,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-21 22:15:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:24,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-21 22:15:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:24,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-21 22:15:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:24,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-21 22:15:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:24,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-21 22:15:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:24,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-21 22:15:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:24,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-21 22:15:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:24,878 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-21 22:15:24,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:24,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582841738] [2023-11-21 22:15:24,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582841738] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:24,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:24,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:15:24,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719065764] [2023-11-21 22:15:24,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:24,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:15:24,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:24,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:15:24,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:15:24,881 INFO L87 Difference]: Start difference. First operand 647 states and 873 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-21 22:15:25,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:25,082 INFO L93 Difference]: Finished difference Result 856 states and 1204 transitions. [2023-11-21 22:15:25,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:15:25,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 71 [2023-11-21 22:15:25,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:15:25,090 INFO L225 Difference]: With dead ends: 856 [2023-11-21 22:15:25,090 INFO L226 Difference]: Without dead ends: 854 [2023-11-21 22:15:25,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-21 22:15:25,091 INFO L413 NwaCegarLoop]: 390 mSDtfsCounter, 171 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:15:25,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1730 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:15:25,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2023-11-21 22:15:25,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 650. [2023-11-21 22:15:25,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 480 states have (on average 1.3666666666666667) internal successors, (656), 484 states have internal predecessors, (656), 110 states have call successors, (110), 59 states have call predecessors, (110), 59 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2023-11-21 22:15:25,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 876 transitions. [2023-11-21 22:15:25,179 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 876 transitions. Word has length 71 [2023-11-21 22:15:25,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:15:25,180 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 876 transitions. [2023-11-21 22:15:25,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-21 22:15:25,180 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 876 transitions. [2023-11-21 22:15:25,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-21 22:15:25,186 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:15:25,187 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:25,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 22:15:25,187 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:15:25,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:25,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1631293061, now seen corresponding path program 1 times [2023-11-21 22:15:25,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:25,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515141302] [2023-11-21 22:15:25,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:25,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:25,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:15:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:25,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-21 22:15:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:25,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 22:15:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:25,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-21 22:15:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:25,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-21 22:15:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:25,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-21 22:15:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:25,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-21 22:15:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:25,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-21 22:15:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:25,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 22:15:25,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:25,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515141302] [2023-11-21 22:15:25,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515141302] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:25,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:25,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:15:25,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035275549] [2023-11-21 22:15:25,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:25,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:15:25,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:25,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:15:25,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:15:25,309 INFO L87 Difference]: Start difference. First operand 650 states and 876 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-21 22:15:25,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:25,532 INFO L93 Difference]: Finished difference Result 1586 states and 2135 transitions. [2023-11-21 22:15:25,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:15:25,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2023-11-21 22:15:25,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:15:25,540 INFO L225 Difference]: With dead ends: 1586 [2023-11-21 22:15:25,540 INFO L226 Difference]: Without dead ends: 1146 [2023-11-21 22:15:25,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:15:25,543 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 188 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:15:25,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 955 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:15:25,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2023-11-21 22:15:25,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1062. [2023-11-21 22:15:25,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 783 states have (on average 1.3537675606641124) internal successors, (1060), 791 states have internal predecessors, (1060), 180 states have call successors, (180), 98 states have call predecessors, (180), 98 states have return successors, (180), 172 states have call predecessors, (180), 180 states have call successors, (180) [2023-11-21 22:15:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1420 transitions. [2023-11-21 22:15:25,672 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1420 transitions. Word has length 71 [2023-11-21 22:15:25,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:15:25,672 INFO L495 AbstractCegarLoop]: Abstraction has 1062 states and 1420 transitions. [2023-11-21 22:15:25,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-21 22:15:25,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1420 transitions. [2023-11-21 22:15:25,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-21 22:15:25,674 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:15:25,674 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:25,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 22:15:25,675 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:15:25,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:25,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1520084800, now seen corresponding path program 1 times [2023-11-21 22:15:25,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:25,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886476546] [2023-11-21 22:15:25,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:25,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:25,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:15:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:25,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-21 22:15:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:25,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-21 22:15:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:25,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-21 22:15:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:25,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-21 22:15:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:25,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-21 22:15:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:25,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-21 22:15:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:25,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-21 22:15:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:25,899 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-21 22:15:25,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:25,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886476546] [2023-11-21 22:15:25,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886476546] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:25,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:25,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:15:25,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526799973] [2023-11-21 22:15:25,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:25,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:15:25,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:25,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:15:25,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:15:25,904 INFO L87 Difference]: Start difference. First operand 1062 states and 1420 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-21 22:15:26,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:26,090 INFO L93 Difference]: Finished difference Result 1836 states and 2459 transitions. [2023-11-21 22:15:26,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:15:26,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-11-21 22:15:26,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:15:26,099 INFO L225 Difference]: With dead ends: 1836 [2023-11-21 22:15:26,099 INFO L226 Difference]: Without dead ends: 1048 [2023-11-21 22:15:26,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:15:26,105 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 7 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 22:15:26,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 634 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 22:15:26,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2023-11-21 22:15:26,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1048. [2023-11-21 22:15:26,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 776 states have (on average 1.3298969072164948) internal successors, (1032), 784 states have internal predecessors, (1032), 173 states have call successors, (173), 98 states have call predecessors, (173), 98 states have return successors, (173), 165 states have call predecessors, (173), 173 states have call successors, (173) [2023-11-21 22:15:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1378 transitions. [2023-11-21 22:15:26,255 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1378 transitions. Word has length 74 [2023-11-21 22:15:26,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:15:26,255 INFO L495 AbstractCegarLoop]: Abstraction has 1048 states and 1378 transitions. [2023-11-21 22:15:26,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-21 22:15:26,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1378 transitions. [2023-11-21 22:15:26,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-21 22:15:26,258 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:15:26,258 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:26,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 22:15:26,258 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:15:26,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:26,259 INFO L85 PathProgramCache]: Analyzing trace with hash 660061754, now seen corresponding path program 1 times [2023-11-21 22:15:26,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:26,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485967485] [2023-11-21 22:15:26,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:26,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:26,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:15:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:26,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-21 22:15:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:26,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 22:15:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:26,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-21 22:15:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:26,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-21 22:15:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:26,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-21 22:15:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:26,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-21 22:15:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:26,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-21 22:15:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:26,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-21 22:15:26,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:26,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485967485] [2023-11-21 22:15:26,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485967485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:26,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:26,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-21 22:15:26,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933336730] [2023-11-21 22:15:26,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:26,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-21 22:15:26,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:26,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-21 22:15:26,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-21 22:15:26,555 INFO L87 Difference]: Start difference. First operand 1048 states and 1378 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-21 22:15:27,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:27,461 INFO L93 Difference]: Finished difference Result 3160 states and 4232 transitions. [2023-11-21 22:15:27,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 22:15:27,462 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2023-11-21 22:15:27,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:15:27,479 INFO L225 Difference]: With dead ends: 3160 [2023-11-21 22:15:27,479 INFO L226 Difference]: Without dead ends: 2372 [2023-11-21 22:15:27,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-11-21 22:15:27,483 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 705 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-21 22:15:27,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1386 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-21 22:15:27,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2023-11-21 22:15:27,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 1966. [2023-11-21 22:15:27,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1966 states, 1439 states have (on average 1.305767894371091) internal successors, (1879), 1455 states have internal predecessors, (1879), 336 states have call successors, (336), 190 states have call predecessors, (336), 190 states have return successors, (336), 320 states have call predecessors, (336), 336 states have call successors, (336) [2023-11-21 22:15:27,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 2551 transitions. [2023-11-21 22:15:27,830 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 2551 transitions. Word has length 73 [2023-11-21 22:15:27,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:15:27,831 INFO L495 AbstractCegarLoop]: Abstraction has 1966 states and 2551 transitions. [2023-11-21 22:15:27,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-21 22:15:27,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 2551 transitions. [2023-11-21 22:15:27,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-21 22:15:27,836 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:15:27,836 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:27,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 22:15:27,836 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:15:27,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:27,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1213709257, now seen corresponding path program 1 times [2023-11-21 22:15:27,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:27,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896485806] [2023-11-21 22:15:27,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:27,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:28,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:15:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:28,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-21 22:15:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:28,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-21 22:15:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:28,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-21 22:15:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:28,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-21 22:15:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:28,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-21 22:15:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:28,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-21 22:15:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:28,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-21 22:15:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:28,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-21 22:15:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-21 22:15:28,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:28,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896485806] [2023-11-21 22:15:28,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896485806] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:15:28,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608062357] [2023-11-21 22:15:28,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:28,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:15:28,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:28,231 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:15:28,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 22:15:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:28,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-21 22:15:28,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:15:28,551 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-21 22:15:28,551 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:15:28,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608062357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:28,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:15:28,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-11-21 22:15:28,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640045029] [2023-11-21 22:15:28,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:28,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:15:28,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:28,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:15:28,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-21 22:15:28,554 INFO L87 Difference]: Start difference. First operand 1966 states and 2551 transitions. Second operand has 6 states, 4 states have (on average 12.25) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-21 22:15:28,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:28,964 INFO L93 Difference]: Finished difference Result 2889 states and 3775 transitions. [2023-11-21 22:15:28,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 22:15:28,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 12.25) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 76 [2023-11-21 22:15:28,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:15:28,976 INFO L225 Difference]: With dead ends: 2889 [2023-11-21 22:15:28,976 INFO L226 Difference]: Without dead ends: 1644 [2023-11-21 22:15:28,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-11-21 22:15:28,981 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 181 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:15:28,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1061 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:15:28,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2023-11-21 22:15:29,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1626. [2023-11-21 22:15:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1193 states have (on average 1.3109807208717519) internal successors, (1564), 1206 states have internal predecessors, (1564), 277 states have call successors, (277), 155 states have call predecessors, (277), 155 states have return successors, (277), 264 states have call predecessors, (277), 277 states have call successors, (277) [2023-11-21 22:15:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2118 transitions. [2023-11-21 22:15:29,298 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2118 transitions. Word has length 76 [2023-11-21 22:15:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:15:29,298 INFO L495 AbstractCegarLoop]: Abstraction has 1626 states and 2118 transitions. [2023-11-21 22:15:29,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 12.25) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-21 22:15:29,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2118 transitions. [2023-11-21 22:15:29,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-21 22:15:29,302 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:15:29,302 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:29,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:29,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-21 22:15:29,518 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:15:29,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:29,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1436817633, now seen corresponding path program 1 times [2023-11-21 22:15:29,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:29,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160747579] [2023-11-21 22:15:29,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:29,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:29,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:15:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:15:29,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:15:29,752 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:15:29,754 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-21 22:15:29,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-21 22:15:29,760 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:29,765 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 22:15:29,867 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-11-21 22:15:29,879 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-11-21 22:15:29,881 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-11-21 22:15:29,885 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated [2023-11-21 22:15:29,887 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret13 could not be translated [2023-11-21 22:15:29,888 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret14 could not be translated [2023-11-21 22:15:29,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:15:29 BoogieIcfgContainer [2023-11-21 22:15:29,941 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 22:15:29,942 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 22:15:29,942 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 22:15:29,942 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 22:15:29,943 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:15:16" (3/4) ... [2023-11-21 22:15:29,943 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-21 22:15:29,980 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-11-21 22:15:29,983 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-11-21 22:15:29,984 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-11-21 22:15:29,986 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated [2023-11-21 22:15:29,987 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret13 could not be translated [2023-11-21 22:15:29,989 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret14 could not be translated [2023-11-21 22:15:30,130 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/witness.graphml [2023-11-21 22:15:30,130 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 22:15:30,131 INFO L158 Benchmark]: Toolchain (without parser) took 15653.19ms. Allocated memory was 138.4MB in the beginning and 455.1MB in the end (delta: 316.7MB). Free memory was 74.9MB in the beginning and 320.1MB in the end (delta: -245.2MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. [2023-11-21 22:15:30,132 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 138.4MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:15:30,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.31ms. Allocated memory is still 138.4MB. Free memory was 74.7MB in the beginning and 57.0MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-21 22:15:30,134 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.83ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 56.8MB in the beginning and 157.5MB in the end (delta: -100.7MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2023-11-21 22:15:30,134 INFO L158 Benchmark]: Boogie Preprocessor took 106.13ms. Allocated memory is still 186.6MB. Free memory was 157.4MB in the beginning and 153.6MB in the end (delta: 3.8MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2023-11-21 22:15:30,135 INFO L158 Benchmark]: RCFGBuilder took 1316.40ms. Allocated memory is still 186.6MB. Free memory was 153.6MB in the beginning and 88.6MB in the end (delta: 65.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2023-11-21 22:15:30,135 INFO L158 Benchmark]: TraceAbstraction took 13458.16ms. Allocated memory was 186.6MB in the beginning and 455.1MB in the end (delta: 268.4MB). Free memory was 87.6MB in the beginning and 335.8MB in the end (delta: -248.2MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2023-11-21 22:15:30,135 INFO L158 Benchmark]: Witness Printer took 188.81ms. Allocated memory is still 455.1MB. Free memory was 335.8MB in the beginning and 320.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-21 22:15:30,138 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.33ms. Allocated memory is still 138.4MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 472.31ms. Allocated memory is still 138.4MB. Free memory was 74.7MB in the beginning and 57.0MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.83ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 56.8MB in the beginning and 157.5MB in the end (delta: -100.7MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.13ms. Allocated memory is still 186.6MB. Free memory was 157.4MB in the beginning and 153.6MB in the end (delta: 3.8MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * RCFGBuilder took 1316.40ms. Allocated memory is still 186.6MB. Free memory was 153.6MB in the beginning and 88.6MB in the end (delta: 65.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * TraceAbstraction took 13458.16ms. Allocated memory was 186.6MB in the beginning and 455.1MB in the end (delta: 268.4MB). Free memory was 87.6MB in the beginning and 335.8MB in the end (delta: -248.2MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * Witness Printer took 188.81ms. Allocated memory is still 455.1MB. Free memory was 335.8MB in the beginning and 320.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret14 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret14 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 618]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L563] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) [L200] COND FALSE !((int )side2Failed_History_0 != 0) [L203] COND FALSE !((int )active_side_History_0 != -2) [L206] COND FALSE !((int )manual_selection_History_0 != 0) [L209] COND FALSE !((int )side1Failed_History_1 != 0) [L212] COND FALSE !((int )side2Failed_History_1 != 0) [L215] COND FALSE !((int )active_side_History_1 != -2) [L218] COND FALSE !((int )manual_selection_History_1 != 0) [L221] COND FALSE !((int )side1Failed_History_2 != 0) [L224] COND FALSE !((int )side2Failed_History_2 != 0) [L227] COND FALSE !((int )active_side_History_2 != -2) [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L58] COND FALSE !(!cond) [L564] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L582] COND TRUE 1 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val [L257] RET write_manual_selection_history(manual_selection) [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val [L276] RET write_side1_failed_history(side1Failed) [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2=-1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L290] COND TRUE (int )side1 == (int )side2 [L291] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2=-1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L408] COND TRUE (int )side1 == (int )nomsg [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; [L447] COND TRUE ! side1Failed [L448] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L58] COND FALSE !(!cond) [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0] [L458] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L458] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] COND TRUE ! tmp___1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0] [L460] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L460] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND TRUE ! tmp___2 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L462] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L462] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L462] tmp___3 = read_side2_failed_history((unsigned char)1) [L463] COND TRUE ! tmp___3 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L464] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L464] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L464] tmp___4 = read_side2_failed_history((unsigned char)0) [L465] COND TRUE ! tmp___4 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L466] COND FALSE !(! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L471] COND FALSE !(! (! ((int )side1_written == 0))) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L476] COND TRUE ! (! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L477] COND TRUE ! ((int )side2_written == 0) [L478] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L616] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L618] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 149 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.2s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3220 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3153 mSDsluCounter, 15823 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11886 mSDsCounter, 491 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1943 IncrementalHoareTripleChecker+Invalid, 2434 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 491 mSolverCounterUnsat, 3937 mSDtfsCounter, 1943 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 527 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1966occurred in iteration=15, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 1036 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1078 NumberOfCodeBlocks, 1078 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1044 ConstructedInterpolants, 0 QuantifiedInterpolants, 2237 SizeOfPredicates, 18 NumberOfNonLiveVariables, 744 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 161/168 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! [2023-11-21 22:15:30,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a0cf14-a5ea-4392-a17a-569e14ccc1c4/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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