./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya --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 f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:50:18,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:50:18,275 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 03:50:18,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:50:18,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:50:18,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:50:18,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:50:18,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:50:18,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:50:18,305 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:50:18,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:50:18,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:50:18,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:50:18,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:50:18,308 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:50:18,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:50:18,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:50:18,309 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:50:18,310 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:50:18,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:50:18,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:50:18,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:50:18,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:50:18,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:50:18,313 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:50:18,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:50:18,314 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:50:18,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:50:18,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:50:18,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:50:18,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:50:18,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:50:18,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:50:18,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:50:18,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:50:18,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:50:18,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:50:18,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:50:18,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:50:18,317 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:50:18,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:50:18,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:50:18,318 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_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/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_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya 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 -> f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 [2023-11-29 03:50:18,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:50:18,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:50:18,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:50:18,539 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:50:18,540 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:50:18,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2023-11-29 03:50:21,288 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:50:21,508 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:50:21,509 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2023-11-29 03:50:21,522 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/data/edf5797e4/2757a0aae8794710bb89b403d29aa4c4/FLAG885dcc060 [2023-11-29 03:50:21,537 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/data/edf5797e4/2757a0aae8794710bb89b403d29aa4c4 [2023-11-29 03:50:21,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:50:21,541 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:50:21,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:50:21,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:50:21,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:50:21,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:50:21" (1/1) ... [2023-11-29 03:50:21,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dcd5a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:21, skipping insertion in model container [2023-11-29 03:50:21,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:50:21" (1/1) ... [2023-11-29 03:50:21,595 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:50:21,744 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_0c276393-1597-4c47-ab71-f4089c1f60e3/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2023-11-29 03:50:21,794 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_0c276393-1597-4c47-ab71-f4089c1f60e3/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2023-11-29 03:50:21,826 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:50:21,838 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:50:21,851 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_0c276393-1597-4c47-ab71-f4089c1f60e3/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2023-11-29 03:50:21,872 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_0c276393-1597-4c47-ab71-f4089c1f60e3/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2023-11-29 03:50:21,890 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:50:21,910 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:50:21,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:21 WrapperNode [2023-11-29 03:50:21,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:50:21,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:50:21,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:50:21,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:50:21,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:21" (1/1) ... [2023-11-29 03:50:21,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:21" (1/1) ... [2023-11-29 03:50:21,962 INFO L138 Inliner]: procedures = 55, calls = 60, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 410 [2023-11-29 03:50:21,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:50:21,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:50:21,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:50:21,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:50:21,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:21" (1/1) ... [2023-11-29 03:50:21,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:21" (1/1) ... [2023-11-29 03:50:21,978 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:21" (1/1) ... [2023-11-29 03:50:21,994 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 03:50:21,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:21" (1/1) ... [2023-11-29 03:50:21,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:21" (1/1) ... [2023-11-29 03:50:22,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:21" (1/1) ... [2023-11-29 03:50:22,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:21" (1/1) ... [2023-11-29 03:50:22,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:21" (1/1) ... [2023-11-29 03:50:22,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:21" (1/1) ... [2023-11-29 03:50:22,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:50:22,022 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:50:22,022 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:50:22,022 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:50:22,023 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:21" (1/1) ... [2023-11-29 03:50:22,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:50:22,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:22,051 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:50:22,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:50:22,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:50:22,076 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-11-29 03:50:22,076 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-11-29 03:50:22,077 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-11-29 03:50:22,077 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-11-29 03:50:22,077 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-11-29 03:50:22,077 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-11-29 03:50:22,077 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-11-29 03:50:22,077 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-11-29 03:50:22,077 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-11-29 03:50:22,077 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-11-29 03:50:22,078 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-11-29 03:50:22,078 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-11-29 03:50:22,078 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-11-29 03:50:22,078 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-11-29 03:50:22,078 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-11-29 03:50:22,078 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-11-29 03:50:22,079 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-11-29 03:50:22,079 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-11-29 03:50:22,079 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-11-29 03:50:22,079 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-11-29 03:50:22,079 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-11-29 03:50:22,079 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-11-29 03:50:22,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:50:22,080 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-11-29 03:50:22,080 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-11-29 03:50:22,080 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-11-29 03:50:22,080 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-11-29 03:50:22,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:50:22,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:50:22,080 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-11-29 03:50:22,080 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-11-29 03:50:22,163 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:50:22,165 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:50:22,528 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:50:22,570 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:50:22,570 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-11-29 03:50:22,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:50:22 BoogieIcfgContainer [2023-11-29 03:50:22,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:50:22,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:50:22,577 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:50:22,581 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:50:22,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:50:21" (1/3) ... [2023-11-29 03:50:22,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678f2d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:50:22, skipping insertion in model container [2023-11-29 03:50:22,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:21" (2/3) ... [2023-11-29 03:50:22,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678f2d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:50:22, skipping insertion in model container [2023-11-29 03:50:22,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:50:22" (3/3) ... [2023-11-29 03:50:22,583 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2023-11-29 03:50:22,620 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:50:22,621 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 03:50:22,691 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:50:22,699 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;@30a52ee1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:50:22,699 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-29 03:50:22,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 140 states have (on average 1.6142857142857143) internal successors, (226), 146 states have internal predecessors, (226), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-11-29 03:50:22,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 03:50:22,717 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:22,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:22,718 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:22,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:22,723 INFO L85 PathProgramCache]: Analyzing trace with hash -601353219, now seen corresponding path program 1 times [2023-11-29 03:50:22,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:22,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527770350] [2023-11-29 03:50:22,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:22,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:23,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:23,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:23,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:50:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:23,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:50:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:23,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:50:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:23,122 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-29 03:50:23,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:23,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527770350] [2023-11-29 03:50:23,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527770350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:23,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:23,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:50:23,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256592800] [2023-11-29 03:50:23,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:23,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:50:23,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:23,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:50:23,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:50:23,165 INFO L87 Difference]: Start difference. First operand has 186 states, 140 states have (on average 1.6142857142857143) internal successors, (226), 146 states have internal predecessors, (226), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:24,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:24,088 INFO L93 Difference]: Finished difference Result 481 states and 741 transitions. [2023-11-29 03:50:24,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:50:24,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-11-29 03:50:24,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:24,101 INFO L225 Difference]: With dead ends: 481 [2023-11-29 03:50:24,101 INFO L226 Difference]: Without dead ends: 304 [2023-11-29 03:50:24,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:50:24,108 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 487 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:24,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 493 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 03:50:24,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-11-29 03:50:24,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 265. [2023-11-29 03:50:24,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 204 states have (on average 1.4803921568627452) internal successors, (302), 209 states have internal predecessors, (302), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2023-11-29 03:50:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 381 transitions. [2023-11-29 03:50:24,188 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 381 transitions. Word has length 51 [2023-11-29 03:50:24,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:24,189 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 381 transitions. [2023-11-29 03:50:24,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:24,189 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 381 transitions. [2023-11-29 03:50:24,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 03:50:24,193 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:24,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:24,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:50:24,193 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:24,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:24,194 INFO L85 PathProgramCache]: Analyzing trace with hash 244995329, now seen corresponding path program 1 times [2023-11-29 03:50:24,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:24,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999927162] [2023-11-29 03:50:24,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:24,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:24,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:24,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:24,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:50:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:24,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:50:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:24,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:50:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:24,353 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-29 03:50:24,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:24,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999927162] [2023-11-29 03:50:24,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999927162] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:24,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:24,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:50:24,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187905933] [2023-11-29 03:50:24,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:24,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:50:24,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:24,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:50:24,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:24,357 INFO L87 Difference]: Start difference. First operand 265 states and 381 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:25,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:25,263 INFO L93 Difference]: Finished difference Result 575 states and 833 transitions. [2023-11-29 03:50:25,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 03:50:25,265 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-11-29 03:50:25,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:25,270 INFO L225 Difference]: With dead ends: 575 [2023-11-29 03:50:25,270 INFO L226 Difference]: Without dead ends: 405 [2023-11-29 03:50:25,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:50:25,274 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 473 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:25,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 757 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 03:50:25,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2023-11-29 03:50:25,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 344. [2023-11-29 03:50:25,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 266 states have (on average 1.4699248120300752) internal successors, (391), 272 states have internal predecessors, (391), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2023-11-29 03:50:25,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 492 transitions. [2023-11-29 03:50:25,330 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 492 transitions. Word has length 51 [2023-11-29 03:50:25,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:25,331 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 492 transitions. [2023-11-29 03:50:25,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:25,331 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 492 transitions. [2023-11-29 03:50:25,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 03:50:25,333 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:25,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:25,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:50:25,334 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:25,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:25,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1126811969, now seen corresponding path program 1 times [2023-11-29 03:50:25,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:25,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655513398] [2023-11-29 03:50:25,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:25,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:25,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:25,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:25,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:50:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:25,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:50:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:25,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:50:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:25,461 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-29 03:50:25,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:25,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655513398] [2023-11-29 03:50:25,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655513398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:25,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:25,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:50:25,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594847570] [2023-11-29 03:50:25,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:25,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:50:25,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:25,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:50:25,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:25,464 INFO L87 Difference]: Start difference. First operand 344 states and 492 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:26,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:26,414 INFO L93 Difference]: Finished difference Result 885 states and 1274 transitions. [2023-11-29 03:50:26,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 03:50:26,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-11-29 03:50:26,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:26,420 INFO L225 Difference]: With dead ends: 885 [2023-11-29 03:50:26,421 INFO L226 Difference]: Without dead ends: 636 [2023-11-29 03:50:26,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:50:26,424 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 485 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:26,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 748 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 03:50:26,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2023-11-29 03:50:26,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 499. [2023-11-29 03:50:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 389 states have (on average 1.4601542416452442) internal successors, (568), 397 states have internal predecessors, (568), 67 states have call successors, (67), 38 states have call predecessors, (67), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2023-11-29 03:50:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 713 transitions. [2023-11-29 03:50:26,489 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 713 transitions. Word has length 51 [2023-11-29 03:50:26,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:26,489 INFO L495 AbstractCegarLoop]: Abstraction has 499 states and 713 transitions. [2023-11-29 03:50:26,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:26,490 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 713 transitions. [2023-11-29 03:50:26,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 03:50:26,492 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:26,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:26,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:50:26,493 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:26,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:26,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1322788161, now seen corresponding path program 1 times [2023-11-29 03:50:26,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:26,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519722418] [2023-11-29 03:50:26,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:26,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:26,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:26,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:26,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:50:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:26,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:50:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:26,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:50:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:26,624 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-29 03:50:26,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:26,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519722418] [2023-11-29 03:50:26,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519722418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:26,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:26,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:50:26,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143243300] [2023-11-29 03:50:26,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:26,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:50:26,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:26,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:50:26,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:26,626 INFO L87 Difference]: Start difference. First operand 499 states and 713 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:27,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:27,817 INFO L93 Difference]: Finished difference Result 2310 states and 3440 transitions. [2023-11-29 03:50:27,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 03:50:27,818 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-11-29 03:50:27,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:27,832 INFO L225 Difference]: With dead ends: 2310 [2023-11-29 03:50:27,833 INFO L226 Difference]: Without dead ends: 1907 [2023-11-29 03:50:27,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-11-29 03:50:27,837 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 988 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:27,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 637 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 03:50:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2023-11-29 03:50:27,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1587. [2023-11-29 03:50:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 1234 states have (on average 1.4246353322528362) internal successors, (1758), 1269 states have internal predecessors, (1758), 208 states have call successors, (208), 128 states have call predecessors, (208), 143 states have return successors, (303), 194 states have call predecessors, (303), 206 states have call successors, (303) [2023-11-29 03:50:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2269 transitions. [2023-11-29 03:50:27,979 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2269 transitions. Word has length 51 [2023-11-29 03:50:27,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:27,980 INFO L495 AbstractCegarLoop]: Abstraction has 1587 states and 2269 transitions. [2023-11-29 03:50:27,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:27,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2269 transitions. [2023-11-29 03:50:27,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 03:50:27,982 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:27,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:27,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:50:27,983 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:27,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:27,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1674297862, now seen corresponding path program 1 times [2023-11-29 03:50:27,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:27,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213736479] [2023-11-29 03:50:27,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:27,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:28,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:28,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:28,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:50:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:28,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:28,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:28,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:50:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:28,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:50:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:28,122 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-29 03:50:28,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:28,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213736479] [2023-11-29 03:50:28,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213736479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:28,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:28,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:50:28,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053848523] [2023-11-29 03:50:28,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:28,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:50:28,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:28,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:50:28,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:50:28,125 INFO L87 Difference]: Start difference. First operand 1587 states and 2269 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 03:50:28,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:28,910 INFO L93 Difference]: Finished difference Result 1793 states and 2567 transitions. [2023-11-29 03:50:28,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 03:50:28,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2023-11-29 03:50:28,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:28,924 INFO L225 Difference]: With dead ends: 1793 [2023-11-29 03:50:28,924 INFO L226 Difference]: Without dead ends: 1712 [2023-11-29 03:50:28,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:50:28,927 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 644 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:28,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 565 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:50:28,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2023-11-29 03:50:29,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1675. [2023-11-29 03:50:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1302 states have (on average 1.424731182795699) internal successors, (1855), 1339 states have internal predecessors, (1855), 219 states have call successors, (219), 135 states have call predecessors, (219), 152 states have return successors, (319), 206 states have call predecessors, (319), 217 states have call successors, (319) [2023-11-29 03:50:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2393 transitions. [2023-11-29 03:50:29,101 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2393 transitions. Word has length 58 [2023-11-29 03:50:29,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:29,101 INFO L495 AbstractCegarLoop]: Abstraction has 1675 states and 2393 transitions. [2023-11-29 03:50:29,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 03:50:29,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2393 transitions. [2023-11-29 03:50:29,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 03:50:29,103 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:29,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:29,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:50:29,104 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:29,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:29,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1529507387, now seen corresponding path program 1 times [2023-11-29 03:50:29,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:29,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076978837] [2023-11-29 03:50:29,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:29,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:29,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:29,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:29,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:50:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:29,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:29,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:29,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:50:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:29,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:50:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:29,245 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-29 03:50:29,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:29,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076978837] [2023-11-29 03:50:29,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076978837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:29,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:29,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:50:29,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230970351] [2023-11-29 03:50:29,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:29,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:50:29,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:29,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:50:29,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:50:29,248 INFO L87 Difference]: Start difference. First operand 1675 states and 2393 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 03:50:30,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:30,152 INFO L93 Difference]: Finished difference Result 1995 states and 2843 transitions. [2023-11-29 03:50:30,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 03:50:30,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2023-11-29 03:50:30,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:30,166 INFO L225 Difference]: With dead ends: 1995 [2023-11-29 03:50:30,166 INFO L226 Difference]: Without dead ends: 1833 [2023-11-29 03:50:30,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-11-29 03:50:30,169 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 675 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:30,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 782 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 03:50:30,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2023-11-29 03:50:30,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1763. [2023-11-29 03:50:30,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1763 states, 1370 states have (on average 1.424087591240876) internal successors, (1951), 1409 states have internal predecessors, (1951), 230 states have call successors, (230), 142 states have call predecessors, (230), 161 states have return successors, (338), 218 states have call predecessors, (338), 228 states have call successors, (338) [2023-11-29 03:50:30,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2519 transitions. [2023-11-29 03:50:30,349 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2519 transitions. Word has length 58 [2023-11-29 03:50:30,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:30,350 INFO L495 AbstractCegarLoop]: Abstraction has 1763 states and 2519 transitions. [2023-11-29 03:50:30,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 03:50:30,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2519 transitions. [2023-11-29 03:50:30,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 03:50:30,352 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:30,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:30,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:50:30,353 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:30,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:30,353 INFO L85 PathProgramCache]: Analyzing trace with hash -837187207, now seen corresponding path program 1 times [2023-11-29 03:50:30,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:30,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667022175] [2023-11-29 03:50:30,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:30,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:30,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:30,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:30,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:50:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:30,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:30,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:30,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:50:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:30,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:50:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:30,479 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-29 03:50:30,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:30,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667022175] [2023-11-29 03:50:30,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667022175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:30,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:30,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 03:50:30,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155880516] [2023-11-29 03:50:30,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:30,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:50:30,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:30,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:50:30,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:50:30,482 INFO L87 Difference]: Start difference. First operand 1763 states and 2519 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 03:50:31,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:31,257 INFO L93 Difference]: Finished difference Result 2039 states and 2908 transitions. [2023-11-29 03:50:31,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:50:31,258 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2023-11-29 03:50:31,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:31,270 INFO L225 Difference]: With dead ends: 2039 [2023-11-29 03:50:31,270 INFO L226 Difference]: Without dead ends: 1795 [2023-11-29 03:50:31,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:50:31,273 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 291 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:31,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 840 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:50:31,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2023-11-29 03:50:31,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1767. [2023-11-29 03:50:31,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1373 states have (on average 1.4217042971595046) internal successors, (1952), 1412 states have internal predecessors, (1952), 230 states have call successors, (230), 142 states have call predecessors, (230), 162 states have return successors, (339), 219 states have call predecessors, (339), 228 states have call successors, (339) [2023-11-29 03:50:31,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2521 transitions. [2023-11-29 03:50:31,465 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2521 transitions. Word has length 58 [2023-11-29 03:50:31,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:31,466 INFO L495 AbstractCegarLoop]: Abstraction has 1767 states and 2521 transitions. [2023-11-29 03:50:31,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 03:50:31,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2521 transitions. [2023-11-29 03:50:31,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 03:50:31,468 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:31,468 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:31,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 03:50:31,468 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:31,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:31,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1213796791, now seen corresponding path program 1 times [2023-11-29 03:50:31,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:31,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421476623] [2023-11-29 03:50:31,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:31,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:31,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:31,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:31,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:50:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:31,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:31,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:31,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:50:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:31,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:50:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:31,602 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-29 03:50:31,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:31,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421476623] [2023-11-29 03:50:31,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421476623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:31,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:31,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 03:50:31,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722381201] [2023-11-29 03:50:31,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:31,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:50:31,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:31,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:50:31,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:50:31,605 INFO L87 Difference]: Start difference. First operand 1767 states and 2521 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 03:50:33,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:33,283 INFO L93 Difference]: Finished difference Result 2991 states and 4219 transitions. [2023-11-29 03:50:33,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 03:50:33,284 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2023-11-29 03:50:33,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:33,300 INFO L225 Difference]: With dead ends: 2991 [2023-11-29 03:50:33,300 INFO L226 Difference]: Without dead ends: 2725 [2023-11-29 03:50:33,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2023-11-29 03:50:33,304 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 1790 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1804 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:33,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1804 Valid, 994 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 03:50:33,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2023-11-29 03:50:33,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 2602. [2023-11-29 03:50:33,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2602 states, 2022 states have (on average 1.3971315529179031) internal successors, (2825), 2076 states have internal predecessors, (2825), 318 states have call successors, (318), 225 states have call predecessors, (318), 260 states have return successors, (453), 306 states have call predecessors, (453), 316 states have call successors, (453) [2023-11-29 03:50:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 3596 transitions. [2023-11-29 03:50:33,571 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 3596 transitions. Word has length 58 [2023-11-29 03:50:33,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:33,572 INFO L495 AbstractCegarLoop]: Abstraction has 2602 states and 3596 transitions. [2023-11-29 03:50:33,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 03:50:33,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 3596 transitions. [2023-11-29 03:50:33,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 03:50:33,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:33,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:33,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 03:50:33,574 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:33,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:33,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1712040131, now seen corresponding path program 1 times [2023-11-29 03:50:33,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:33,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878808143] [2023-11-29 03:50:33,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:33,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:33,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:33,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:33,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:50:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:33,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:33,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:33,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:50:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:33,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:50:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:33,693 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-29 03:50:33,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:33,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878808143] [2023-11-29 03:50:33,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878808143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:33,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:33,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 03:50:33,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692320288] [2023-11-29 03:50:33,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:33,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:50:33,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:33,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:50:33,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:50:33,695 INFO L87 Difference]: Start difference. First operand 2602 states and 3596 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 03:50:34,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:34,520 INFO L93 Difference]: Finished difference Result 3795 states and 5171 transitions. [2023-11-29 03:50:34,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:50:34,520 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2023-11-29 03:50:34,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:34,537 INFO L225 Difference]: With dead ends: 3795 [2023-11-29 03:50:34,537 INFO L226 Difference]: Without dead ends: 2700 [2023-11-29 03:50:34,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:50:34,541 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 201 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:34,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 934 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:50:34,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2023-11-29 03:50:34,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2626. [2023-11-29 03:50:34,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2040 states have (on average 1.3897058823529411) internal successors, (2835), 2094 states have internal predecessors, (2835), 318 states have call successors, (318), 225 states have call predecessors, (318), 266 states have return successors, (459), 312 states have call predecessors, (459), 316 states have call successors, (459) [2023-11-29 03:50:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 3612 transitions. [2023-11-29 03:50:34,849 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 3612 transitions. Word has length 59 [2023-11-29 03:50:34,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:34,849 INFO L495 AbstractCegarLoop]: Abstraction has 2626 states and 3612 transitions. [2023-11-29 03:50:34,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 03:50:34,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 3612 transitions. [2023-11-29 03:50:34,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 03:50:34,852 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:34,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:34,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 03:50:34,852 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:34,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:34,853 INFO L85 PathProgramCache]: Analyzing trace with hash 211187903, now seen corresponding path program 1 times [2023-11-29 03:50:34,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:34,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018622819] [2023-11-29 03:50:34,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:34,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:34,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:34,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:34,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:50:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:34,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:34,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:34,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:50:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:35,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:50:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:35,027 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-29 03:50:35,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:35,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018622819] [2023-11-29 03:50:35,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018622819] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:35,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:35,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:50:35,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751656536] [2023-11-29 03:50:35,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:35,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:50:35,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:35,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:50:35,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:50:35,030 INFO L87 Difference]: Start difference. First operand 2626 states and 3612 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 03:50:35,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:35,860 INFO L93 Difference]: Finished difference Result 3776 states and 5054 transitions. [2023-11-29 03:50:35,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 03:50:35,860 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2023-11-29 03:50:35,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:35,873 INFO L225 Difference]: With dead ends: 3776 [2023-11-29 03:50:35,873 INFO L226 Difference]: Without dead ends: 2864 [2023-11-29 03:50:35,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-11-29 03:50:35,876 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 628 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:35,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 582 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:50:35,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2023-11-29 03:50:36,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 2571. [2023-11-29 03:50:36,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2571 states, 2001 states have (on average 1.3878060969515242) internal successors, (2777), 2050 states have internal predecessors, (2777), 312 states have call successors, (312), 220 states have call predecessors, (312), 256 states have return successors, (444), 305 states have call predecessors, (444), 310 states have call successors, (444) [2023-11-29 03:50:36,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3533 transitions. [2023-11-29 03:50:36,075 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3533 transitions. Word has length 59 [2023-11-29 03:50:36,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:36,075 INFO L495 AbstractCegarLoop]: Abstraction has 2571 states and 3533 transitions. [2023-11-29 03:50:36,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 03:50:36,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3533 transitions. [2023-11-29 03:50:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 03:50:36,077 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:36,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:36,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 03:50:36,078 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:36,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:36,078 INFO L85 PathProgramCache]: Analyzing trace with hash 430042621, now seen corresponding path program 1 times [2023-11-29 03:50:36,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:36,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578816451] [2023-11-29 03:50:36,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:36,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:36,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:36,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:36,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:50:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:36,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:36,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:36,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:50:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:36,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:50:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:36,156 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-29 03:50:36,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:36,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578816451] [2023-11-29 03:50:36,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578816451] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:36,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:36,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:50:36,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631930801] [2023-11-29 03:50:36,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:36,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:50:36,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:36,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:50:36,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:36,158 INFO L87 Difference]: Start difference. First operand 2571 states and 3533 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 03:50:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:36,919 INFO L93 Difference]: Finished difference Result 4720 states and 6304 transitions. [2023-11-29 03:50:36,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:50:36,920 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2023-11-29 03:50:36,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:36,942 INFO L225 Difference]: With dead ends: 4720 [2023-11-29 03:50:36,942 INFO L226 Difference]: Without dead ends: 3657 [2023-11-29 03:50:36,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-11-29 03:50:36,946 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 617 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:36,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 466 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:50:36,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3657 states. [2023-11-29 03:50:37,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3657 to 3541. [2023-11-29 03:50:37,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3541 states, 2728 states have (on average 1.347507331378299) internal successors, (3676), 2794 states have internal predecessors, (3676), 431 states have call successors, (431), 319 states have call predecessors, (431), 380 states have return successors, (635), 433 states have call predecessors, (635), 429 states have call successors, (635) [2023-11-29 03:50:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3541 states to 3541 states and 4742 transitions. [2023-11-29 03:50:37,402 INFO L78 Accepts]: Start accepts. Automaton has 3541 states and 4742 transitions. Word has length 59 [2023-11-29 03:50:37,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:37,403 INFO L495 AbstractCegarLoop]: Abstraction has 3541 states and 4742 transitions. [2023-11-29 03:50:37,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 03:50:37,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3541 states and 4742 transitions. [2023-11-29 03:50:37,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 03:50:37,404 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:37,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:37,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 03:50:37,405 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:37,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:37,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1129756660, now seen corresponding path program 1 times [2023-11-29 03:50:37,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:37,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445638631] [2023-11-29 03:50:37,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:37,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:37,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:37,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:37,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:50:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:37,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:37,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:37,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:50:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:37,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:50:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:37,471 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-29 03:50:37,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:37,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445638631] [2023-11-29 03:50:37,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445638631] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:37,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:37,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:50:37,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557538246] [2023-11-29 03:50:37,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:37,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:50:37,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:37,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:50:37,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:50:37,473 INFO L87 Difference]: Start difference. First operand 3541 states and 4742 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 03:50:38,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:38,252 INFO L93 Difference]: Finished difference Result 6593 states and 8623 transitions. [2023-11-29 03:50:38,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:50:38,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2023-11-29 03:50:38,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:38,279 INFO L225 Difference]: With dead ends: 6593 [2023-11-29 03:50:38,279 INFO L226 Difference]: Without dead ends: 4565 [2023-11-29 03:50:38,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:50:38,287 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 497 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:38,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 442 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:50:38,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4565 states. [2023-11-29 03:50:38,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4565 to 4307. [2023-11-29 03:50:38,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4307 states, 3308 states have (on average 1.3310157194679564) internal successors, (4403), 3379 states have internal predecessors, (4403), 523 states have call successors, (523), 399 states have call predecessors, (523), 474 states have return successors, (749), 534 states have call predecessors, (749), 521 states have call successors, (749) [2023-11-29 03:50:38,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4307 states to 4307 states and 5675 transitions. [2023-11-29 03:50:38,723 INFO L78 Accepts]: Start accepts. Automaton has 4307 states and 5675 transitions. Word has length 60 [2023-11-29 03:50:38,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:38,723 INFO L495 AbstractCegarLoop]: Abstraction has 4307 states and 5675 transitions. [2023-11-29 03:50:38,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 03:50:38,723 INFO L276 IsEmpty]: Start isEmpty. Operand 4307 states and 5675 transitions. [2023-11-29 03:50:38,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-29 03:50:38,726 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:38,726 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:38,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 03:50:38,726 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:38,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:38,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1039441133, now seen corresponding path program 1 times [2023-11-29 03:50:38,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:38,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21172878] [2023-11-29 03:50:38,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:38,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:38,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:38,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:38,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:50:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:38,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:38,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:38,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:50:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:38,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:50:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:38,794 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-29 03:50:38,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:38,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21172878] [2023-11-29 03:50:38,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21172878] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:38,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:38,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:50:38,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432347108] [2023-11-29 03:50:38,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:38,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:50:38,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:38,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:50:38,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:50:38,796 INFO L87 Difference]: Start difference. First operand 4307 states and 5675 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 03:50:39,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:39,651 INFO L93 Difference]: Finished difference Result 7871 states and 10141 transitions. [2023-11-29 03:50:39,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:50:39,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2023-11-29 03:50:39,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:39,673 INFO L225 Difference]: With dead ends: 7871 [2023-11-29 03:50:39,673 INFO L226 Difference]: Without dead ends: 5075 [2023-11-29 03:50:39,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:50:39,679 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 461 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:39,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 514 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:50:39,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5075 states. [2023-11-29 03:50:40,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5075 to 4811. [2023-11-29 03:50:40,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4811 states, 3698 states have (on average 1.3231476473769606) internal successors, (4893), 3773 states have internal predecessors, (4893), 579 states have call successors, (579), 449 states have call predecessors, (579), 532 states have return successors, (822), 594 states have call predecessors, (822), 577 states have call successors, (822) [2023-11-29 03:50:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4811 states to 4811 states and 6294 transitions. [2023-11-29 03:50:40,067 INFO L78 Accepts]: Start accepts. Automaton has 4811 states and 6294 transitions. Word has length 66 [2023-11-29 03:50:40,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:40,068 INFO L495 AbstractCegarLoop]: Abstraction has 4811 states and 6294 transitions. [2023-11-29 03:50:40,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 03:50:40,068 INFO L276 IsEmpty]: Start isEmpty. Operand 4811 states and 6294 transitions. [2023-11-29 03:50:40,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-29 03:50:40,070 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:40,070 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:40,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 03:50:40,070 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:40,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:40,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1620938651, now seen corresponding path program 1 times [2023-11-29 03:50:40,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:40,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31434829] [2023-11-29 03:50:40,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:40,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:40,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:40,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:40,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:50:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:40,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:40,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:40,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:50:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:40,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:50:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:40,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:40,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:40,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31434829] [2023-11-29 03:50:40,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31434829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:40,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:40,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:50:40,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085880352] [2023-11-29 03:50:40,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:40,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:50:40,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:40,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:50:40,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:40,145 INFO L87 Difference]: Start difference. First operand 4811 states and 6294 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 03:50:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:40,987 INFO L93 Difference]: Finished difference Result 5819 states and 7511 transitions. [2023-11-29 03:50:40,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:50:40,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 67 [2023-11-29 03:50:40,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:41,008 INFO L225 Difference]: With dead ends: 5819 [2023-11-29 03:50:41,008 INFO L226 Difference]: Without dead ends: 5816 [2023-11-29 03:50:41,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2023-11-29 03:50:41,010 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 833 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:41,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 385 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:50:41,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5816 states. [2023-11-29 03:50:41,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5816 to 5231. [2023-11-29 03:50:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5231 states, 4011 states have (on average 1.31313886811269) internal successors, (5267), 4089 states have internal predecessors, (5267), 629 states have call successors, (629), 493 states have call predecessors, (629), 589 states have return successors, (899), 654 states have call predecessors, (899), 628 states have call successors, (899) [2023-11-29 03:50:41,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5231 states to 5231 states and 6795 transitions. [2023-11-29 03:50:41,567 INFO L78 Accepts]: Start accepts. Automaton has 5231 states and 6795 transitions. Word has length 67 [2023-11-29 03:50:41,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:41,568 INFO L495 AbstractCegarLoop]: Abstraction has 5231 states and 6795 transitions. [2023-11-29 03:50:41,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 03:50:41,568 INFO L276 IsEmpty]: Start isEmpty. Operand 5231 states and 6795 transitions. [2023-11-29 03:50:41,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 03:50:41,570 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:41,570 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:41,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 03:50:41,570 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:41,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:41,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1291137955, now seen corresponding path program 1 times [2023-11-29 03:50:41,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:41,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448744506] [2023-11-29 03:50:41,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:41,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:41,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:41,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:41,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:50:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:41,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:41,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:41,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:50:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:41,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:50:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:41,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:41,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448744506] [2023-11-29 03:50:41,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448744506] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:41,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208733588] [2023-11-29 03:50:41,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:41,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:41,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:41,699 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:41,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 03:50:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:41,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 03:50:41,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:42,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:42,039 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:50:42,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:42,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208733588] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:50:42,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:50:42,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2023-11-29 03:50:42,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391651539] [2023-11-29 03:50:42,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:50:42,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:50:42,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:42,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:50:42,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:50:42,128 INFO L87 Difference]: Start difference. First operand 5231 states and 6795 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 03:50:43,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:43,929 INFO L93 Difference]: Finished difference Result 9203 states and 11658 transitions. [2023-11-29 03:50:43,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 03:50:43,929 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 68 [2023-11-29 03:50:43,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:43,953 INFO L225 Difference]: With dead ends: 9203 [2023-11-29 03:50:43,953 INFO L226 Difference]: Without dead ends: 9200 [2023-11-29 03:50:43,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2023-11-29 03:50:43,957 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 1293 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:43,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1346 Valid, 819 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 03:50:43,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9200 states. [2023-11-29 03:50:44,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9200 to 8348. [2023-11-29 03:50:44,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8348 states, 6386 states have (on average 1.2918885061071093) internal successors, (8250), 6499 states have internal predecessors, (8250), 988 states have call successors, (988), 807 states have call predecessors, (988), 972 states have return successors, (1400), 1047 states have call predecessors, (1400), 987 states have call successors, (1400) [2023-11-29 03:50:44,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8348 states to 8348 states and 10638 transitions. [2023-11-29 03:50:44,845 INFO L78 Accepts]: Start accepts. Automaton has 8348 states and 10638 transitions. Word has length 68 [2023-11-29 03:50:44,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:44,845 INFO L495 AbstractCegarLoop]: Abstraction has 8348 states and 10638 transitions. [2023-11-29 03:50:44,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 03:50:44,845 INFO L276 IsEmpty]: Start isEmpty. Operand 8348 states and 10638 transitions. [2023-11-29 03:50:44,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-29 03:50:44,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:44,849 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-29 03:50:44,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:50:45,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 03:50:45,050 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:45,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:45,051 INFO L85 PathProgramCache]: Analyzing trace with hash 613804699, now seen corresponding path program 2 times [2023-11-29 03:50:45,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:45,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534999108] [2023-11-29 03:50:45,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:45,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:45,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:45,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:45,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:50:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:45,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:45,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:45,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:50:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:45,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:50:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:45,123 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:45,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:45,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534999108] [2023-11-29 03:50:45,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534999108] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:45,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:45,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:50:45,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198768189] [2023-11-29 03:50:45,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:45,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:50:45,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:45,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:50:45,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:50:45,126 INFO L87 Difference]: Start difference. First operand 8348 states and 10638 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 03:50:46,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:46,081 INFO L93 Difference]: Finished difference Result 10736 states and 13641 transitions. [2023-11-29 03:50:46,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:50:46,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2023-11-29 03:50:46,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:46,093 INFO L225 Difference]: With dead ends: 10736 [2023-11-29 03:50:46,093 INFO L226 Difference]: Without dead ends: 5098 [2023-11-29 03:50:46,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:50:46,101 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 409 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:46,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 553 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:50:46,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5098 states. [2023-11-29 03:50:46,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5098 to 4162. [2023-11-29 03:50:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4162 states, 3206 states have (on average 1.310979413599501) internal successors, (4203), 3265 states have internal predecessors, (4203), 507 states have call successors, (507), 389 states have call predecessors, (507), 447 states have return successors, (699), 513 states have call predecessors, (699), 506 states have call successors, (699) [2023-11-29 03:50:46,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4162 states to 4162 states and 5409 transitions. [2023-11-29 03:50:46,494 INFO L78 Accepts]: Start accepts. Automaton has 4162 states and 5409 transitions. Word has length 71 [2023-11-29 03:50:46,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:46,495 INFO L495 AbstractCegarLoop]: Abstraction has 4162 states and 5409 transitions. [2023-11-29 03:50:46,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 03:50:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 4162 states and 5409 transitions. [2023-11-29 03:50:46,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-29 03:50:46,497 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:46,497 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:46,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 03:50:46,498 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:46,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:46,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1786536504, now seen corresponding path program 1 times [2023-11-29 03:50:46,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:46,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724778641] [2023-11-29 03:50:46,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:46,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:46,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:46,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:46,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:50:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:46,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:46,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:46,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:50:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:46,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:50:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:46,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:50:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:46,627 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 03:50:46,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:46,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724778641] [2023-11-29 03:50:46,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724778641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:46,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:46,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:50:46,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456849910] [2023-11-29 03:50:46,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:46,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:50:46,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:46,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:50:46,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:50:46,630 INFO L87 Difference]: Start difference. First operand 4162 states and 5409 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 03:50:47,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:47,969 INFO L93 Difference]: Finished difference Result 9480 states and 11940 transitions. [2023-11-29 03:50:47,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 03:50:47,970 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2023-11-29 03:50:47,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:47,981 INFO L225 Difference]: With dead ends: 9480 [2023-11-29 03:50:47,981 INFO L226 Difference]: Without dead ends: 6090 [2023-11-29 03:50:47,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2023-11-29 03:50:47,986 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 952 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:47,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 629 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:50:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6090 states. [2023-11-29 03:50:48,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6090 to 5830. [2023-11-29 03:50:48,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5830 states, 4439 states have (on average 1.2739355710745663) internal successors, (5655), 4535 states have internal predecessors, (5655), 707 states have call successors, (707), 561 states have call predecessors, (707), 682 states have return successors, (1049), 739 states have call predecessors, (1049), 706 states have call successors, (1049) [2023-11-29 03:50:48,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5830 states to 5830 states and 7411 transitions. [2023-11-29 03:50:48,554 INFO L78 Accepts]: Start accepts. Automaton has 5830 states and 7411 transitions. Word has length 76 [2023-11-29 03:50:48,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:48,555 INFO L495 AbstractCegarLoop]: Abstraction has 5830 states and 7411 transitions. [2023-11-29 03:50:48,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 03:50:48,555 INFO L276 IsEmpty]: Start isEmpty. Operand 5830 states and 7411 transitions. [2023-11-29 03:50:48,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-29 03:50:48,560 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:48,560 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 03:50:48,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 03:50:48,561 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:48,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:48,561 INFO L85 PathProgramCache]: Analyzing trace with hash -870154435, now seen corresponding path program 1 times [2023-11-29 03:50:48,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:48,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585219156] [2023-11-29 03:50:48,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:48,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:48,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:48,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:48,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:50:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:48,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:50:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:48,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:50:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:48,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 03:50:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:48,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:50:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:48,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 03:50:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 03:50:48,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:48,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585219156] [2023-11-29 03:50:48,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585219156] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:48,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189906243] [2023-11-29 03:50:48,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:48,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:48,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:48,676 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:48,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 03:50:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:48,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:50:48,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 03:50:48,791 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:50:48,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189906243] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:48,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:50:48,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 03:50:48,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422859877] [2023-11-29 03:50:48,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:48,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:50:48,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:48,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:50:48,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:48,793 INFO L87 Difference]: Start difference. First operand 5830 states and 7411 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:50:49,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:49,645 INFO L93 Difference]: Finished difference Result 8647 states and 11540 transitions. [2023-11-29 03:50:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:50:49,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2023-11-29 03:50:49,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:49,665 INFO L225 Difference]: With dead ends: 8647 [2023-11-29 03:50:49,666 INFO L226 Difference]: Without dead ends: 7157 [2023-11-29 03:50:49,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:49,671 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 107 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:49,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 565 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:50:49,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7157 states. [2023-11-29 03:50:50,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7157 to 7157. [2023-11-29 03:50:50,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7157 states, 5482 states have (on average 1.2949653411163808) internal successors, (7099), 5595 states have internal predecessors, (7099), 866 states have call successors, (866), 667 states have call predecessors, (866), 807 states have return successors, (1348), 904 states have call predecessors, (1348), 865 states have call successors, (1348) [2023-11-29 03:50:50,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7157 states to 7157 states and 9313 transitions. [2023-11-29 03:50:50,334 INFO L78 Accepts]: Start accepts. Automaton has 7157 states and 9313 transitions. Word has length 83 [2023-11-29 03:50:50,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:50,334 INFO L495 AbstractCegarLoop]: Abstraction has 7157 states and 9313 transitions. [2023-11-29 03:50:50,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:50:50,334 INFO L276 IsEmpty]: Start isEmpty. Operand 7157 states and 9313 transitions. [2023-11-29 03:50:50,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 03:50:50,341 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:50,341 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:50,347 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 03:50:50,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 03:50:50,542 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:50,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:50,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1286896662, now seen corresponding path program 1 times [2023-11-29 03:50:50,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:50,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392243364] [2023-11-29 03:50:50,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:50,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:50,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:50,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:50,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:50:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:50,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:50,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:50,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:50:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:50,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:50:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:50,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 03:50:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 03:50:50,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:50,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392243364] [2023-11-29 03:50:50,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392243364] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:50,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:50,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 03:50:50,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588868428] [2023-11-29 03:50:50,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:50,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:50:50,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:50,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:50:50,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:50:50,670 INFO L87 Difference]: Start difference. First operand 7157 states and 9313 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 03:50:52,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:52,156 INFO L93 Difference]: Finished difference Result 10247 states and 13061 transitions. [2023-11-29 03:50:52,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 03:50:52,157 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2023-11-29 03:50:52,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:52,175 INFO L225 Difference]: With dead ends: 10247 [2023-11-29 03:50:52,175 INFO L226 Difference]: Without dead ends: 6404 [2023-11-29 03:50:52,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2023-11-29 03:50:52,185 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 1182 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:52,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 640 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 03:50:52,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6404 states. [2023-11-29 03:50:52,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6404 to 6000. [2023-11-29 03:50:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6000 states, 4591 states have (on average 1.2973208451317795) internal successors, (5956), 4692 states have internal predecessors, (5956), 731 states have call successors, (731), 549 states have call predecessors, (731), 676 states have return successors, (1117), 768 states have call predecessors, (1117), 730 states have call successors, (1117) [2023-11-29 03:50:52,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6000 states to 6000 states and 7804 transitions. [2023-11-29 03:50:52,901 INFO L78 Accepts]: Start accepts. Automaton has 6000 states and 7804 transitions. Word has length 86 [2023-11-29 03:50:52,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:52,901 INFO L495 AbstractCegarLoop]: Abstraction has 6000 states and 7804 transitions. [2023-11-29 03:50:52,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 03:50:52,901 INFO L276 IsEmpty]: Start isEmpty. Operand 6000 states and 7804 transitions. [2023-11-29 03:50:52,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-29 03:50:52,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:52,908 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:52,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 03:50:52,909 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:52,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:52,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2098998010, now seen corresponding path program 1 times [2023-11-29 03:50:52,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:52,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894328661] [2023-11-29 03:50:52,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:52,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:52,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:52,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:52,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:50:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:52,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:50:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:52,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:50:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:52,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 03:50:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:53,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:50:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:53,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 03:50:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:53,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:50:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:53,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:50:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-29 03:50:53,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:53,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894328661] [2023-11-29 03:50:53,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894328661] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:53,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382986406] [2023-11-29 03:50:53,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:53,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:53,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:53,016 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:53,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 03:50:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:53,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:50:53,125 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:53,207 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 03:50:53,207 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:50:53,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382986406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:53,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:50:53,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-11-29 03:50:53,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530601174] [2023-11-29 03:50:53,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:53,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:50:53,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:53,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:50:53,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:53,209 INFO L87 Difference]: Start difference. First operand 6000 states and 7804 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 03:50:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:53,929 INFO L93 Difference]: Finished difference Result 9537 states and 12971 transitions. [2023-11-29 03:50:53,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:50:53,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 106 [2023-11-29 03:50:53,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:53,946 INFO L225 Difference]: With dead ends: 9537 [2023-11-29 03:50:53,946 INFO L226 Difference]: Without dead ends: 7398 [2023-11-29 03:50:53,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:53,952 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 187 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:53,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 347 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:50:53,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7398 states. [2023-11-29 03:50:54,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7398 to 7356. [2023-11-29 03:50:54,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7356 states, 5657 states have (on average 1.3155382711684638) internal successors, (7442), 5779 states have internal predecessors, (7442), 895 states have call successors, (895), 659 states have call predecessors, (895), 802 states have return successors, (1361), 927 states have call predecessors, (1361), 894 states have call successors, (1361) [2023-11-29 03:50:54,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 9698 transitions. [2023-11-29 03:50:54,844 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 9698 transitions. Word has length 106 [2023-11-29 03:50:54,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:54,845 INFO L495 AbstractCegarLoop]: Abstraction has 7356 states and 9698 transitions. [2023-11-29 03:50:54,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 03:50:54,845 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 9698 transitions. [2023-11-29 03:50:54,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 03:50:54,852 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:54,852 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2023-11-29 03:50:54,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 03:50:55,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:55,053 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:55,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:55,053 INFO L85 PathProgramCache]: Analyzing trace with hash -227743173, now seen corresponding path program 1 times [2023-11-29 03:50:55,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:55,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993279145] [2023-11-29 03:50:55,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:55,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:55,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:55,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:55,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:50:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:55,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:50:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:55,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:50:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:55,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:50:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:55,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 03:50:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:55,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:50:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:55,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:50:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:55,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:50:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:55,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 03:50:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:55,144 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-29 03:50:55,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:55,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993279145] [2023-11-29 03:50:55,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993279145] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:55,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547909761] [2023-11-29 03:50:55,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:55,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:55,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:55,146 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:55,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 03:50:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:55,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:50:55,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-29 03:50:55,281 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:50:55,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547909761] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:55,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:50:55,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 03:50:55,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657611446] [2023-11-29 03:50:55,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:55,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:50:55,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:55,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:50:55,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:55,283 INFO L87 Difference]: Start difference. First operand 7356 states and 9698 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 03:50:55,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:55,945 INFO L93 Difference]: Finished difference Result 11932 states and 16445 transitions. [2023-11-29 03:50:55,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:50:55,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 121 [2023-11-29 03:50:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:55,963 INFO L225 Difference]: With dead ends: 11932 [2023-11-29 03:50:55,963 INFO L226 Difference]: Without dead ends: 7760 [2023-11-29 03:50:55,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:55,976 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 232 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:55,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 255 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:50:55,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7760 states. [2023-11-29 03:50:56,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7760 to 7665. [2023-11-29 03:50:56,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7665 states, 5941 states have (on average 1.2790775963642484) internal successors, (7599), 6058 states have internal predecessors, (7599), 891 states have call successors, (891), 685 states have call predecessors, (891), 831 states have return successors, (1343), 931 states have call predecessors, (1343), 890 states have call successors, (1343) [2023-11-29 03:50:56,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7665 states to 7665 states and 9833 transitions. [2023-11-29 03:50:56,765 INFO L78 Accepts]: Start accepts. Automaton has 7665 states and 9833 transitions. Word has length 121 [2023-11-29 03:50:56,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:56,766 INFO L495 AbstractCegarLoop]: Abstraction has 7665 states and 9833 transitions. [2023-11-29 03:50:56,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 03:50:56,766 INFO L276 IsEmpty]: Start isEmpty. Operand 7665 states and 9833 transitions. [2023-11-29 03:50:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 03:50:56,772 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:56,772 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2023-11-29 03:50:56,777 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 03:50:56,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:56,973 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:56,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:56,973 INFO L85 PathProgramCache]: Analyzing trace with hash -583652392, now seen corresponding path program 1 times [2023-11-29 03:50:56,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:56,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431632744] [2023-11-29 03:50:56,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:56,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:57,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:57,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:57,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:50:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:57,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:50:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:57,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:50:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:57,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:50:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:57,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 03:50:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:57,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:50:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:57,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:50:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:57,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:50:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:57,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 03:50:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-11-29 03:50:57,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:57,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431632744] [2023-11-29 03:50:57,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431632744] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:57,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848630928] [2023-11-29 03:50:57,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:57,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:57,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:57,082 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:57,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 03:50:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:57,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:50:57,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:57,259 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 03:50:57,259 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:50:57,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848630928] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:57,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:50:57,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 03:50:57,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796237211] [2023-11-29 03:50:57,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:57,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:50:57,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:57,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:50:57,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:57,261 INFO L87 Difference]: Start difference. First operand 7665 states and 9833 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 03:50:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:57,960 INFO L93 Difference]: Finished difference Result 12053 states and 15822 transitions. [2023-11-29 03:50:57,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:50:57,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 121 [2023-11-29 03:50:57,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:57,974 INFO L225 Difference]: With dead ends: 12053 [2023-11-29 03:50:57,974 INFO L226 Difference]: Without dead ends: 7880 [2023-11-29 03:50:57,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:57,983 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 212 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:57,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 358 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:50:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7880 states. [2023-11-29 03:50:58,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7880 to 7635. [2023-11-29 03:50:58,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7635 states, 5911 states have (on average 1.2652681441380478) internal successors, (7479), 6028 states have internal predecessors, (7479), 891 states have call successors, (891), 685 states have call predecessors, (891), 831 states have return successors, (1343), 931 states have call predecessors, (1343), 890 states have call successors, (1343) [2023-11-29 03:50:58,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7635 states to 7635 states and 9713 transitions. [2023-11-29 03:50:58,679 INFO L78 Accepts]: Start accepts. Automaton has 7635 states and 9713 transitions. Word has length 121 [2023-11-29 03:50:58,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:58,679 INFO L495 AbstractCegarLoop]: Abstraction has 7635 states and 9713 transitions. [2023-11-29 03:50:58,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 03:50:58,679 INFO L276 IsEmpty]: Start isEmpty. Operand 7635 states and 9713 transitions. [2023-11-29 03:50:58,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-29 03:50:58,685 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:58,686 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2023-11-29 03:50:58,690 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 03:50:58,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-29 03:50:58,886 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:58,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:58,887 INFO L85 PathProgramCache]: Analyzing trace with hash -625591146, now seen corresponding path program 1 times [2023-11-29 03:50:58,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:58,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654832843] [2023-11-29 03:50:58,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:58,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:58,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:50:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:58,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:50:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:58,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:50:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:58,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:50:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:58,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:50:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:58,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 03:50:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:58,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:50:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:58,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 03:50:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:58,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 03:50:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:58,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:50:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:58,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:50:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-29 03:50:58,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:58,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654832843] [2023-11-29 03:50:58,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654832843] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:58,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652705683] [2023-11-29 03:50:58,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:58,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:58,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:58,989 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:58,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 03:50:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:59,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:50:59,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:59,130 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-29 03:50:59,130 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:50:59,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652705683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:59,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:50:59,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 03:50:59,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319119896] [2023-11-29 03:50:59,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:59,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:50:59,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:59,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:50:59,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:59,132 INFO L87 Difference]: Start difference. First operand 7635 states and 9713 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 03:51:00,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:00,205 INFO L93 Difference]: Finished difference Result 16245 states and 21461 transitions. [2023-11-29 03:51:00,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:51:00,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 122 [2023-11-29 03:51:00,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:00,230 INFO L225 Difference]: With dead ends: 16245 [2023-11-29 03:51:00,230 INFO L226 Difference]: Without dead ends: 11798 [2023-11-29 03:51:00,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:51:00,240 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 105 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:00,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 559 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:51:00,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11798 states. [2023-11-29 03:51:01,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11798 to 11796. [2023-11-29 03:51:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11796 states, 9186 states have (on average 1.2668190725016328) internal successors, (11637), 9368 states have internal predecessors, (11637), 1379 states have call successors, (1379), 1035 states have call predecessors, (1379), 1229 states have return successors, (2339), 1410 states have call predecessors, (2339), 1378 states have call successors, (2339) [2023-11-29 03:51:01,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11796 states to 11796 states and 15355 transitions. [2023-11-29 03:51:01,230 INFO L78 Accepts]: Start accepts. Automaton has 11796 states and 15355 transitions. Word has length 122 [2023-11-29 03:51:01,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:01,230 INFO L495 AbstractCegarLoop]: Abstraction has 11796 states and 15355 transitions. [2023-11-29 03:51:01,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 03:51:01,230 INFO L276 IsEmpty]: Start isEmpty. Operand 11796 states and 15355 transitions. [2023-11-29 03:51:01,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-29 03:51:01,240 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:01,241 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2023-11-29 03:51:01,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 03:51:01,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:01,441 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:51:01,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:01,441 INFO L85 PathProgramCache]: Analyzing trace with hash -331376281, now seen corresponding path program 1 times [2023-11-29 03:51:01,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:01,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387713948] [2023-11-29 03:51:01,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:01,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:01,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:51:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:01,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:51:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:01,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:51:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:01,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:51:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:01,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:51:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:01,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 03:51:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:01,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 03:51:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:01,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:01,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:51:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:01,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:01,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 03:51:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-29 03:51:01,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:01,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387713948] [2023-11-29 03:51:01,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387713948] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:51:01,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718607234] [2023-11-29 03:51:01,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:01,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:01,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:51:01,540 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:51:01,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 03:51:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:01,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:51:01,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:51:01,702 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 03:51:01,702 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:51:01,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718607234] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:51:01,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:51:01,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 03:51:01,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277913967] [2023-11-29 03:51:01,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:51:01,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:51:01,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:51:01,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:51:01,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:51:01,705 INFO L87 Difference]: Start difference. First operand 11796 states and 15355 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 03:51:02,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:02,567 INFO L93 Difference]: Finished difference Result 14994 states and 20001 transitions. [2023-11-29 03:51:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:51:02,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2023-11-29 03:51:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:02,593 INFO L225 Difference]: With dead ends: 14994 [2023-11-29 03:51:02,593 INFO L226 Difference]: Without dead ends: 10692 [2023-11-29 03:51:02,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:51:02,607 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 73 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:02,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 523 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:51:02,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10692 states. [2023-11-29 03:51:03,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10692 to 10562. [2023-11-29 03:51:03,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10562 states, 8218 states have (on average 1.253102944755415) internal successors, (10298), 8384 states have internal predecessors, (10298), 1235 states have call successors, (1235), 935 states have call predecessors, (1235), 1107 states have return successors, (1999), 1260 states have call predecessors, (1999), 1234 states have call successors, (1999) [2023-11-29 03:51:03,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10562 states to 10562 states and 13532 transitions. [2023-11-29 03:51:03,521 INFO L78 Accepts]: Start accepts. Automaton has 10562 states and 13532 transitions. Word has length 123 [2023-11-29 03:51:03,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:03,521 INFO L495 AbstractCegarLoop]: Abstraction has 10562 states and 13532 transitions. [2023-11-29 03:51:03,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 03:51:03,521 INFO L276 IsEmpty]: Start isEmpty. Operand 10562 states and 13532 transitions. [2023-11-29 03:51:03,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 03:51:03,531 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:03,531 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2023-11-29 03:51:03,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 03:51:03,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:03,732 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:51:03,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:03,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1388399477, now seen corresponding path program 1 times [2023-11-29 03:51:03,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:03,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577145403] [2023-11-29 03:51:03,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:03,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:03,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:51:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:03,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:51:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:03,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:51:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:03,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:51:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:03,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:51:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:03,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 03:51:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:03,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 03:51:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:03,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:03,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:51:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:03,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:03,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 03:51:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:03,819 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-29 03:51:03,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:03,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577145403] [2023-11-29 03:51:03,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577145403] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:51:03,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599460063] [2023-11-29 03:51:03,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:03,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:03,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:51:03,820 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:51:03,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 03:51:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:03,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:51:03,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:51:03,998 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-29 03:51:03,998 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:51:03,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599460063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:51:03,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:51:03,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-11-29 03:51:03,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401962086] [2023-11-29 03:51:03,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:51:03,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:51:03,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:51:04,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:51:04,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:51:04,000 INFO L87 Difference]: Start difference. First operand 10562 states and 13532 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:51:05,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:05,004 INFO L93 Difference]: Finished difference Result 13680 states and 17820 transitions. [2023-11-29 03:51:05,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:51:05,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 124 [2023-11-29 03:51:05,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:05,025 INFO L225 Difference]: With dead ends: 13680 [2023-11-29 03:51:05,025 INFO L226 Difference]: Without dead ends: 9082 [2023-11-29 03:51:05,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:51:05,034 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 282 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:05,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 331 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:51:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9082 states. [2023-11-29 03:51:05,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9082 to 9022. [2023-11-29 03:51:05,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9022 states, 6998 states have (on average 1.2222063446699056) internal successors, (8553), 7118 states have internal predecessors, (8553), 1075 states have call successors, (1075), 815 states have call predecessors, (1075), 947 states have return successors, (1626), 1098 states have call predecessors, (1626), 1074 states have call successors, (1626) [2023-11-29 03:51:05,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9022 states to 9022 states and 11254 transitions. [2023-11-29 03:51:05,859 INFO L78 Accepts]: Start accepts. Automaton has 9022 states and 11254 transitions. Word has length 124 [2023-11-29 03:51:05,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:05,859 INFO L495 AbstractCegarLoop]: Abstraction has 9022 states and 11254 transitions. [2023-11-29 03:51:05,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:51:05,859 INFO L276 IsEmpty]: Start isEmpty. Operand 9022 states and 11254 transitions. [2023-11-29 03:51:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 03:51:05,866 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:05,866 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2023-11-29 03:51:05,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 03:51:06,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:06,067 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:51:06,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:06,067 INFO L85 PathProgramCache]: Analyzing trace with hash 504890487, now seen corresponding path program 1 times [2023-11-29 03:51:06,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:06,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605451411] [2023-11-29 03:51:06,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:06,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:06,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:51:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:06,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:51:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:06,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:51:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:06,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:51:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:06,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:51:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:06,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 03:51:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:06,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 03:51:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:06,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:06,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:51:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:06,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:06,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 03:51:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:06,162 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-29 03:51:06,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:06,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605451411] [2023-11-29 03:51:06,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605451411] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:51:06,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565025470] [2023-11-29 03:51:06,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:06,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:06,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:51:06,165 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:51:06,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 03:51:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:06,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:51:06,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:51:06,318 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-29 03:51:06,318 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:51:06,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565025470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:51:06,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:51:06,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-11-29 03:51:06,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821948458] [2023-11-29 03:51:06,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:51:06,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:51:06,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:51:06,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:51:06,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:51:06,320 INFO L87 Difference]: Start difference. First operand 9022 states and 11254 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:51:07,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:07,477 INFO L93 Difference]: Finished difference Result 13976 states and 17854 transitions. [2023-11-29 03:51:07,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:51:07,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 124 [2023-11-29 03:51:07,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:07,497 INFO L225 Difference]: With dead ends: 13976 [2023-11-29 03:51:07,498 INFO L226 Difference]: Without dead ends: 8406 [2023-11-29 03:51:07,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:51:07,508 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 300 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:07,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 326 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:51:07,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8406 states. [2023-11-29 03:51:08,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8406 to 6580. [2023-11-29 03:51:08,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6580 states, 5092 states have (on average 1.1908876669285153) internal successors, (6064), 5180 states have internal predecessors, (6064), 775 states have call successors, (775), 599 states have call predecessors, (775), 711 states have return successors, (1147), 806 states have call predecessors, (1147), 774 states have call successors, (1147) [2023-11-29 03:51:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6580 states to 6580 states and 7986 transitions. [2023-11-29 03:51:08,128 INFO L78 Accepts]: Start accepts. Automaton has 6580 states and 7986 transitions. Word has length 124 [2023-11-29 03:51:08,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:08,128 INFO L495 AbstractCegarLoop]: Abstraction has 6580 states and 7986 transitions. [2023-11-29 03:51:08,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:51:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 6580 states and 7986 transitions. [2023-11-29 03:51:08,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 03:51:08,132 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:08,132 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2023-11-29 03:51:08,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 03:51:08,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-29 03:51:08,333 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:51:08,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:08,333 INFO L85 PathProgramCache]: Analyzing trace with hash 476390197, now seen corresponding path program 1 times [2023-11-29 03:51:08,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:08,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619607213] [2023-11-29 03:51:08,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:08,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:08,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:51:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:08,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:51:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:08,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:51:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:08,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:51:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:08,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:51:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:08,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 03:51:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:08,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 03:51:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:08,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:08,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:51:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:08,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:08,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 03:51:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:08,437 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-29 03:51:08,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:08,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619607213] [2023-11-29 03:51:08,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619607213] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:51:08,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648107425] [2023-11-29 03:51:08,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:08,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:08,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:51:08,439 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:51:08,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 03:51:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:08,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:51:08,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:51:08,557 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 03:51:08,557 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:51:08,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648107425] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:51:08,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:51:08,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-29 03:51:08,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336774715] [2023-11-29 03:51:08,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:51:08,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:51:08,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:51:08,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:51:08,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:51:08,559 INFO L87 Difference]: Start difference. First operand 6580 states and 7986 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:51:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:09,167 INFO L93 Difference]: Finished difference Result 8962 states and 11044 transitions. [2023-11-29 03:51:09,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:51:09,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 124 [2023-11-29 03:51:09,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:09,174 INFO L225 Difference]: With dead ends: 8962 [2023-11-29 03:51:09,174 INFO L226 Difference]: Without dead ends: 5017 [2023-11-29 03:51:09,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:51:09,178 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 11 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:09,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 674 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:51:09,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5017 states. [2023-11-29 03:51:09,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5017 to 5017. [2023-11-29 03:51:09,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5017 states, 3857 states have (on average 1.1817474721285974) internal successors, (4558), 3927 states have internal predecessors, (4558), 585 states have call successors, (585), 469 states have call predecessors, (585), 573 states have return successors, (804), 624 states have call predecessors, (804), 584 states have call successors, (804) [2023-11-29 03:51:09,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5017 states to 5017 states and 5947 transitions. [2023-11-29 03:51:09,649 INFO L78 Accepts]: Start accepts. Automaton has 5017 states and 5947 transitions. Word has length 124 [2023-11-29 03:51:09,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:09,649 INFO L495 AbstractCegarLoop]: Abstraction has 5017 states and 5947 transitions. [2023-11-29 03:51:09,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:51:09,649 INFO L276 IsEmpty]: Start isEmpty. Operand 5017 states and 5947 transitions. [2023-11-29 03:51:09,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 03:51:09,652 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:09,652 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2023-11-29 03:51:09,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 03:51:09,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-29 03:51:09,853 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:51:09,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:09,853 INFO L85 PathProgramCache]: Analyzing trace with hash -18663819, now seen corresponding path program 1 times [2023-11-29 03:51:09,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:09,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104635042] [2023-11-29 03:51:09,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:09,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:09,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:51:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:09,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:51:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:09,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:51:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:09,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:51:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:09,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:51:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:09,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 03:51:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:09,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 03:51:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:09,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:09,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:51:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:09,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:09,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 03:51:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-29 03:51:09,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:09,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104635042] [2023-11-29 03:51:09,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104635042] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:51:09,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089875598] [2023-11-29 03:51:09,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:09,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:09,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:51:09,943 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:51:09,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 03:51:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:10,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:51:10,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:51:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-29 03:51:10,052 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:51:10,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089875598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:51:10,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:51:10,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-29 03:51:10,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857878041] [2023-11-29 03:51:10,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:51:10,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:51:10,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:51:10,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:51:10,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:51:10,053 INFO L87 Difference]: Start difference. First operand 5017 states and 5947 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:51:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:10,530 INFO L93 Difference]: Finished difference Result 6100 states and 7255 transitions. [2023-11-29 03:51:10,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:51:10,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 124 [2023-11-29 03:51:10,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:10,537 INFO L225 Difference]: With dead ends: 6100 [2023-11-29 03:51:10,538 INFO L226 Difference]: Without dead ends: 3895 [2023-11-29 03:51:10,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:51:10,541 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 2 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:10,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 673 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:51:10,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states. [2023-11-29 03:51:10,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 3895. [2023-11-29 03:51:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3895 states, 2956 states have (on average 1.1830175913396481) internal successors, (3497), 3015 states have internal predecessors, (3497), 461 states have call successors, (461), 380 states have call predecessors, (461), 476 states have return successors, (621), 502 states have call predecessors, (621), 460 states have call successors, (621) [2023-11-29 03:51:10,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3895 states to 3895 states and 4579 transitions. [2023-11-29 03:51:10,946 INFO L78 Accepts]: Start accepts. Automaton has 3895 states and 4579 transitions. Word has length 124 [2023-11-29 03:51:10,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:10,947 INFO L495 AbstractCegarLoop]: Abstraction has 3895 states and 4579 transitions. [2023-11-29 03:51:10,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:51:10,947 INFO L276 IsEmpty]: Start isEmpty. Operand 3895 states and 4579 transitions. [2023-11-29 03:51:10,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 03:51:10,949 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:10,949 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2023-11-29 03:51:10,953 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 03:51:11,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-29 03:51:11,149 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:51:11,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:11,150 INFO L85 PathProgramCache]: Analyzing trace with hash 564461877, now seen corresponding path program 1 times [2023-11-29 03:51:11,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:11,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606457555] [2023-11-29 03:51:11,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:11,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:11,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:51:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:11,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:51:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:11,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:51:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:11,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:51:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:11,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:51:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:11,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 03:51:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:11,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 03:51:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:11,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:11,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:51:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:11,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:11,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 03:51:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-29 03:51:11,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:11,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606457555] [2023-11-29 03:51:11,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606457555] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:51:11,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:51:11,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:51:11,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771707736] [2023-11-29 03:51:11,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:51:11,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:51:11,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:51:11,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:51:11,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:51:11,249 INFO L87 Difference]: Start difference. First operand 3895 states and 4579 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-29 03:51:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:12,096 INFO L93 Difference]: Finished difference Result 4052 states and 4754 transitions. [2023-11-29 03:51:12,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:51:12,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 124 [2023-11-29 03:51:12,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:12,103 INFO L225 Difference]: With dead ends: 4052 [2023-11-29 03:51:12,103 INFO L226 Difference]: Without dead ends: 3175 [2023-11-29 03:51:12,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:51:12,106 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 526 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:12,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 517 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:51:12,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2023-11-29 03:51:12,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 3175. [2023-11-29 03:51:12,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3175 states, 2381 states have (on average 1.1978160436791263) internal successors, (2852), 2432 states have internal predecessors, (2852), 378 states have call successors, (378), 323 states have call predecessors, (378), 415 states have return successors, (527), 421 states have call predecessors, (527), 377 states have call successors, (527) [2023-11-29 03:51:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 3757 transitions. [2023-11-29 03:51:12,459 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 3757 transitions. Word has length 124 [2023-11-29 03:51:12,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:12,460 INFO L495 AbstractCegarLoop]: Abstraction has 3175 states and 3757 transitions. [2023-11-29 03:51:12,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-29 03:51:12,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 3757 transitions. [2023-11-29 03:51:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-29 03:51:12,462 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:12,462 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2023-11-29 03:51:12,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 03:51:12,462 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:51:12,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:12,462 INFO L85 PathProgramCache]: Analyzing trace with hash -2135958772, now seen corresponding path program 1 times [2023-11-29 03:51:12,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:12,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735276432] [2023-11-29 03:51:12,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:12,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:12,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:51:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:12,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:51:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:12,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:51:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:12,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:51:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:12,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:51:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:12,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:51:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:12,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:51:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:12,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:51:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:12,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 03:51:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:12,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:51:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:12,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:51:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:12,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:51:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:12,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:51:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:12,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 03:51:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:12,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 03:51:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:12,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:51:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:12,609 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-29 03:51:12,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:12,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735276432] [2023-11-29 03:51:12,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735276432] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:51:12,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373087366] [2023-11-29 03:51:12,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:12,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:12,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:51:12,610 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:51:12,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 03:51:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:12,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:51:12,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:51:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 03:51:12,751 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:51:12,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373087366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:51:12,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:51:12,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2023-11-29 03:51:12,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463085249] [2023-11-29 03:51:12,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:51:12,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:51:12,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:51:12,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:51:12,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:51:12,752 INFO L87 Difference]: Start difference. First operand 3175 states and 3757 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 03:51:13,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:13,014 INFO L93 Difference]: Finished difference Result 4888 states and 5834 transitions. [2023-11-29 03:51:13,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:51:13,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2023-11-29 03:51:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:13,018 INFO L225 Difference]: With dead ends: 4888 [2023-11-29 03:51:13,018 INFO L226 Difference]: Without dead ends: 1728 [2023-11-29 03:51:13,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-11-29 03:51:13,021 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 32 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:13,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 529 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:51:13,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2023-11-29 03:51:13,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1606. [2023-11-29 03:51:13,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1258 states have (on average 1.1915739268680445) internal successors, (1499), 1272 states have internal predecessors, (1499), 167 states have call successors, (167), 137 states have call predecessors, (167), 180 states have return successors, (234), 196 states have call predecessors, (234), 166 states have call successors, (234) [2023-11-29 03:51:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1900 transitions. [2023-11-29 03:51:13,258 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1900 transitions. Word has length 131 [2023-11-29 03:51:13,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:13,259 INFO L495 AbstractCegarLoop]: Abstraction has 1606 states and 1900 transitions. [2023-11-29 03:51:13,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 03:51:13,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1900 transitions. [2023-11-29 03:51:13,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-29 03:51:13,261 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:13,261 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2023-11-29 03:51:13,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 03:51:13,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:13,461 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:51:13,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:13,462 INFO L85 PathProgramCache]: Analyzing trace with hash 584859742, now seen corresponding path program 1 times [2023-11-29 03:51:13,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:13,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254407312] [2023-11-29 03:51:13,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:13,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:13,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:51:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:13,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:51:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:13,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:51:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:13,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:51:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:13,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:51:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:13,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:51:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:13,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:51:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:13,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:51:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:13,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 03:51:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:13,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 03:51:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:13,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:51:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:13,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:51:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:13,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:51:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:13,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 03:51:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:13,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 03:51:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:13,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:51:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:13,538 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-11-29 03:51:13,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:13,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254407312] [2023-11-29 03:51:13,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254407312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:51:13,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:51:13,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:51:13,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727911237] [2023-11-29 03:51:13,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:51:13,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:51:13,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:51:13,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:51:13,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:51:13,540 INFO L87 Difference]: Start difference. First operand 1606 states and 1900 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 03:51:13,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:13,833 INFO L93 Difference]: Finished difference Result 1654 states and 1950 transitions. [2023-11-29 03:51:13,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:51:13,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 133 [2023-11-29 03:51:13,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:13,836 INFO L225 Difference]: With dead ends: 1654 [2023-11-29 03:51:13,836 INFO L226 Difference]: Without dead ends: 1314 [2023-11-29 03:51:13,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:51:13,838 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 248 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:13,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 139 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:51:13,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2023-11-29 03:51:13,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1269. [2023-11-29 03:51:13,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1005 states have (on average 1.2009950248756218) internal successors, (1207), 1016 states have internal predecessors, (1207), 126 states have call successors, (126), 102 states have call predecessors, (126), 137 states have return successors, (179), 150 states have call predecessors, (179), 125 states have call successors, (179) [2023-11-29 03:51:13,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1512 transitions. [2023-11-29 03:51:13,967 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1512 transitions. Word has length 133 [2023-11-29 03:51:13,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:13,968 INFO L495 AbstractCegarLoop]: Abstraction has 1269 states and 1512 transitions. [2023-11-29 03:51:13,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 03:51:13,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1512 transitions. [2023-11-29 03:51:13,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 03:51:13,969 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:13,969 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:51:13,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 03:51:13,969 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:51:13,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:13,969 INFO L85 PathProgramCache]: Analyzing trace with hash -2138979480, now seen corresponding path program 1 times [2023-11-29 03:51:13,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:13,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659378851] [2023-11-29 03:51:13,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:13,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:51:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:51:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:51:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:51:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:51:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:51:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:51:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 03:51:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 03:51:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 03:51:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:51:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:51:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:51:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:51:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:51:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 03:51:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-29 03:51:14,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:14,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659378851] [2023-11-29 03:51:14,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659378851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:51:14,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:51:14,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:51:14,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115612628] [2023-11-29 03:51:14,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:51:14,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:51:14,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:51:14,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:51:14,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:51:14,055 INFO L87 Difference]: Start difference. First operand 1269 states and 1512 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-29 03:51:14,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:14,404 INFO L93 Difference]: Finished difference Result 2420 states and 2896 transitions. [2023-11-29 03:51:14,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:51:14,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 145 [2023-11-29 03:51:14,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:14,406 INFO L225 Difference]: With dead ends: 2420 [2023-11-29 03:51:14,406 INFO L226 Difference]: Without dead ends: 1249 [2023-11-29 03:51:14,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:51:14,408 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 137 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:14,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 373 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:51:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2023-11-29 03:51:14,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1168. [2023-11-29 03:51:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 928 states have (on average 1.206896551724138) internal successors, (1120), 939 states have internal predecessors, (1120), 114 states have call successors, (114), 92 states have call predecessors, (114), 125 states have return successors, (161), 136 states have call predecessors, (161), 113 states have call successors, (161) [2023-11-29 03:51:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1395 transitions. [2023-11-29 03:51:14,555 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1395 transitions. Word has length 145 [2023-11-29 03:51:14,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:14,555 INFO L495 AbstractCegarLoop]: Abstraction has 1168 states and 1395 transitions. [2023-11-29 03:51:14,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-29 03:51:14,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1395 transitions. [2023-11-29 03:51:14,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-29 03:51:14,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:14,556 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 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-29 03:51:14,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-29 03:51:14,557 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:51:14,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:14,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1972482544, now seen corresponding path program 1 times [2023-11-29 03:51:14,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:14,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987271792] [2023-11-29 03:51:14,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:14,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:51:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:51:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:51:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:51:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:51:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:51:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:51:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 03:51:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 03:51:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:51:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 03:51:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:51:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:51:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 03:51:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 03:51:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-29 03:51:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,722 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-29 03:51:14,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:14,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987271792] [2023-11-29 03:51:14,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987271792] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:51:14,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992706805] [2023-11-29 03:51:14,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:14,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:14,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:51:14,723 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:51:14,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 03:51:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:14,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 03:51:14,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:51:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-29 03:51:14,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:51:15,184 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-29 03:51:15,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992706805] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:51:15,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:51:15,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2023-11-29 03:51:15,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142892997] [2023-11-29 03:51:15,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:51:15,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 03:51:15,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:51:15,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 03:51:15,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-11-29 03:51:15,187 INFO L87 Difference]: Start difference. First operand 1168 states and 1395 transitions. Second operand has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2023-11-29 03:51:16,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:16,060 INFO L93 Difference]: Finished difference Result 2759 states and 3389 transitions. [2023-11-29 03:51:16,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 03:51:16,061 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 147 [2023-11-29 03:51:16,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:16,063 INFO L225 Difference]: With dead ends: 2759 [2023-11-29 03:51:16,063 INFO L226 Difference]: Without dead ends: 1536 [2023-11-29 03:51:16,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2023-11-29 03:51:16,065 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 591 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:16,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 364 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:51:16,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2023-11-29 03:51:16,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1428. [2023-11-29 03:51:16,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1113 states have (on average 1.1725067385444743) internal successors, (1305), 1125 states have internal predecessors, (1305), 154 states have call successors, (154), 130 states have call predecessors, (154), 160 states have return successors, (230), 172 states have call predecessors, (230), 153 states have call successors, (230) [2023-11-29 03:51:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1689 transitions. [2023-11-29 03:51:16,233 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1689 transitions. Word has length 147 [2023-11-29 03:51:16,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:16,234 INFO L495 AbstractCegarLoop]: Abstraction has 1428 states and 1689 transitions. [2023-11-29 03:51:16,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2023-11-29 03:51:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1689 transitions. [2023-11-29 03:51:16,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-11-29 03:51:16,236 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:16,236 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 03:51:16,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 03:51:16,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-11-29 03:51:16,436 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:51:16,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:16,437 INFO L85 PathProgramCache]: Analyzing trace with hash -2132921149, now seen corresponding path program 1 times [2023-11-29 03:51:16,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:16,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862282669] [2023-11-29 03:51:16,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:16,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:51:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:51:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:51:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:51:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:51:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:51:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:51:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 03:51:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 03:51:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:51:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 03:51:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:51:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:51:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:51:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:51:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 03:51:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 03:51:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-29 03:51:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 03:51:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 03:51:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:51:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:51:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-11-29 03:51:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-11-29 03:51:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-11-29 03:51:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2023-11-29 03:51:16,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:16,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862282669] [2023-11-29 03:51:16,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862282669] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:51:16,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391604588] [2023-11-29 03:51:16,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:16,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:16,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:51:16,583 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:51:16,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 03:51:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:51:16,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:51:16,844 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 229 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 03:51:16,845 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:51:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 102 proven. 7 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-11-29 03:51:17,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391604588] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:51:17,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:51:17,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2023-11-29 03:51:17,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618326560] [2023-11-29 03:51:17,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:51:17,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 03:51:17,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:51:17,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 03:51:17,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:51:17,024 INFO L87 Difference]: Start difference. First operand 1428 states and 1689 transitions. Second operand has 11 states, 11 states have (on average 18.818181818181817) internal successors, (207), 8 states have internal predecessors, (207), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2023-11-29 03:51:17,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:17,603 INFO L93 Difference]: Finished difference Result 1759 states and 2061 transitions. [2023-11-29 03:51:17,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 03:51:17,603 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 18.818181818181817) internal successors, (207), 8 states have internal predecessors, (207), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) Word has length 230 [2023-11-29 03:51:17,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:17,604 INFO L225 Difference]: With dead ends: 1759 [2023-11-29 03:51:17,604 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 03:51:17,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 505 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2023-11-29 03:51:17,605 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 335 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:17,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 287 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:51:17,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 03:51:17,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 03:51:17,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:51:17,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 03:51:17,606 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 230 [2023-11-29 03:51:17,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:17,606 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 03:51:17,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.818181818181817) internal successors, (207), 8 states have internal predecessors, (207), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2023-11-29 03:51:17,606 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 03:51:17,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 03:51:17,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-11-29 03:51:17,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-29 03:51:17,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-29 03:51:17,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-11-29 03:51:17,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 03:51:23,847 WARN L293 SmtUtils]: Spent 5.60s on a formula simplification. DAG size of input: 124 DAG size of output: 109 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 03:51:37,946 WARN L293 SmtUtils]: Spent 13.27s on a formula simplification. DAG size of input: 126 DAG size of output: 134 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 03:52:12,406 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 812 822) no Hoare annotation was computed. [2023-11-29 03:52:12,406 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 812 822) no Hoare annotation was computed. [2023-11-29 03:52:12,407 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 812 822) the Hoare annotation is: (let ((.cse5 (< ~E_M~0 2)) (.cse0 (< ~T1_E~0 2)) (.cse1 (not (= ~q_req_up~0 0))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse4 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse13 (not (= ~t1_pc~0 1))) (.cse6 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (not (= ~q_free~0 0))) (.cse14 (< |old(~m_st~0)| 2)) (.cse15 (< ~E_1~0 2)) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 (not (= ~m_pc~0 ~t1_pc~0)) .cse2 (< 0 ~t1_pc~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse4 (< |old(~t1_st~0)| 2) .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~token~0 ~local~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse12 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 (not (= (+ ~local~0 1) ~token~0)) .cse12))) [2023-11-29 03:52:12,407 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 226 240) no Hoare annotation was computed. [2023-11-29 03:52:12,407 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 48 52) no Hoare annotation was computed. [2023-11-29 03:52:12,407 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2023-11-29 03:52:12,408 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 226 240) the Hoare annotation is: (let ((.cse25 (= ~c_dr_pc~0 1)) (.cse17 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse36 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse15 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse16 (= ~q_req_up~0 0)) (.cse18 (= ~q_read_ev~0 2))) (let ((.cse26 (= ~m_pc~0 1)) (.cse29 (not (= ~c_dr_pc~0 0))) (.cse30 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse31 (not (= ~p_num_write~0 0))) (.cse32 (not (= ~p_dw_pc~0 0))) (.cse33 (not (= ~c_num_read~0 0))) (.cse34 (and .cse15 .cse16 (= ~q_write_ev~0 2) .cse18)) (.cse3 (< |old(~q_write_ev~0)| 2)) (.cse27 (not (= |old(~q_req_up~0)| 1))) (.cse20 (and .cse15 .cse17 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse36)) (.cse21 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse22 (not .cse25)) (.cse23 (not (= ~q_free~0 1))) (.cse35 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (< 0 ~t1_pc~0)) (.cse4 (not (= ~M_E~0 2))) (.cse24 (and .cse15 .cse17 .cse36 .cse18)) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (= ~q_free~0 0))) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse11 (not (= |old(~q_read_ev~0)| 2))) (.cse12 (< ~E_1~0 2)) (.cse13 (not (= ~p_dw_i~0 1))) (.cse14 (not (= |old(~q_req_up~0)| 0))) (.cse28 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse15 .cse16 .cse17 .cse18) .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse21 .cse8 .cse9 .cse10 .cse22 .cse12 .cse13 .cse23 .cse14 .cse19) (or .cse0 .cse1 .cse4 .cse24 .cse5 .cse25 .cse6 .cse26 .cse7 .cse9 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse27 .cse5 .cse6 .cse7 .cse8 (and (= ~q_req_up~0 1) .cse15 .cse17 .cse18) .cse9 .cse10 .cse11 .cse12 .cse13 .cse28 .cse19) (or .cse0 .cse1 .cse4 .cse29 .cse30 .cse5 .cse31 .cse32 .cse6 .cse26 .cse33 .cse34 .cse9 .cse11 .cse23 .cse14 .cse35) (or .cse1 (not .cse8) .cse2 .cse4 .cse29 .cse30 .cse5 .cse31 .cse32 .cse6 .cse33 .cse34 .cse9 .cse10 .cse11 .cse12 .cse13 .cse23 .cse14 .cse35 .cse19) (or .cse0 (< |old(~q_read_ev~0)| 1) .cse1 .cse2 .cse3 .cse4 .cse27 .cse20 .cse5 .cse6 .cse21 .cse8 .cse9 .cse10 .cse22 .cse12 .cse13 .cse23 .cse35 .cse19) (or .cse0 .cse1 .cse2 .cse4 .cse24 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |old(~q_write_ev~0)| 0) .cse14 .cse28 .cse19)))) [2023-11-29 03:52:12,408 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 42 57) no Hoare annotation was computed. [2023-11-29 03:52:12,408 INFO L899 garLoopResultBuilder]: For program point L230-1(lines 226 240) no Hoare annotation was computed. [2023-11-29 03:52:12,408 INFO L899 garLoopResultBuilder]: For program point L803-2(lines 787 811) no Hoare annotation was computed. [2023-11-29 03:52:12,408 INFO L899 garLoopResultBuilder]: For program point L795(lines 795 799) no Hoare annotation was computed. [2023-11-29 03:52:12,408 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 606) no Hoare annotation was computed. [2023-11-29 03:52:12,408 INFO L899 garLoopResultBuilder]: For program point L795-2(lines 795 799) no Hoare annotation was computed. [2023-11-29 03:52:12,409 INFO L899 garLoopResultBuilder]: For program point L630(lines 618 632) no Hoare annotation was computed. [2023-11-29 03:52:12,409 INFO L899 garLoopResultBuilder]: For program point L620(lines 620 625) no Hoare annotation was computed. [2023-11-29 03:52:12,409 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 787 811) the Hoare annotation is: (let ((.cse18 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse16 (not (= ~token~0 ~local~0))) (.cse19 (< |old(~t1_st~0)| 2)) (.cse5 (not (= ~t1_pc~0 1))) (.cse20 (not (= (+ ~local~0 1) ~token~0))) (.cse0 (< ~T1_E~0 2)) (.cse1 (not (= ~q_req_up~0 0))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse17 (< 0 ~t1_pc~0)) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse4 (and .cse18 (= ~m_st~0 |old(~m_st~0)|))) (.cse6 (< ~E_M~0 2)) (.cse7 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse8 (not (= ~p_num_write~0 0))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (= ~c_num_read~0 0))) (.cse12 (not (= ~q_free~0 0))) (.cse13 (< |old(~m_st~0)| 2)) (.cse14 (< ~E_1~0 2)) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 (not (= ~m_pc~0 ~t1_pc~0)) .cse2 .cse17 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15) (or .cse0 (and .cse18 (= ~m_st~0 0)) .cse1 .cse2 .cse3 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= |old(~m_st~0)| 0)) .cse14 .cse20 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15) (or .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2023-11-29 03:52:12,409 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 787 811) no Hoare annotation was computed. [2023-11-29 03:52:12,409 INFO L899 garLoopResultBuilder]: For program point L600(lines 600 609) no Hoare annotation was computed. [2023-11-29 03:52:12,409 INFO L899 garLoopResultBuilder]: For program point L600-2(lines 600 609) no Hoare annotation was computed. [2023-11-29 03:52:12,409 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 628) no Hoare annotation was computed. [2023-11-29 03:52:12,409 INFO L899 garLoopResultBuilder]: For program point L619-2(lines 619 628) no Hoare annotation was computed. [2023-11-29 03:52:12,409 INFO L899 garLoopResultBuilder]: For program point L611(lines 599 613) no Hoare annotation was computed. [2023-11-29 03:52:12,409 INFO L899 garLoopResultBuilder]: For program point L803(lines 803 807) no Hoare annotation was computed. [2023-11-29 03:52:12,410 INFO L895 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (let ((.cse22 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse17 (not (= ~c_dr_pc~0 0))) (.cse18 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse19 (not (= ~p_num_write~0 0))) (.cse20 (not (= ~p_dw_pc~0 0))) (.cse26 (= ~m_pc~0 1)) (.cse21 (not (= ~c_num_read~0 0))) (.cse24 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse25 (= ~c_dr_pc~0 1)) (.cse23 (not (= ~q_free~0 1))) (.cse14 (< ~q_write_ev~0 2)) (.cse0 (not (= ~q_req_up~0 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (< 0 ~t1_pc~0)) (.cse3 (not (= ~M_E~0 2))) (.cse4 (= |old(~p_dw_st~0)| 0)) (.cse5 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse22)) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~q_free~0 0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse11 (< ~E_1~0 2)) (.cse12 (not (= ~p_dw_i~0 1))) (.cse13 (= |old(~c_dr_st~0)| 0)) (.cse15 (not (= ~q_read_ev~0 2))) (.cse16 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse17 .cse6 .cse18 .cse19 .cse20 .cse7 .cse21 .cse9 .cse10 (and .cse22 (= ~p_dw_st~0 0)) .cse11 .cse12 .cse23 (not .cse4) .cse15 .cse24 .cse16) (or .cse1 .cse3 .cse5 .cse6 .cse25 .cse7 .cse26 .cse8 .cse9 .cse13 .cse15) (or .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse18 .cse19 .cse20 .cse7 .cse26 .cse21 .cse9 .cse23 .cse13 .cse15 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~c_num_read~0 ~p_num_write~0)) .cse9 .cse10 (not .cse25) .cse11 .cse12 .cse23 .cse13 .cse14 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~q_write_ev~0 0) .cse11 .cse12 .cse13 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse15 .cse16)))) [2023-11-29 03:52:12,410 INFO L895 garLoopResultBuilder]: At program point L323-2(lines 323 327) the Hoare annotation is: (let ((.cse28 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse20 (= activate_threads1_~tmp~1 0)) (.cse21 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse3 (= ~c_dr_pc~0 1))) (let ((.cse12 (not (= ~c_dr_pc~0 0))) (.cse13 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse14 (not (= ~p_num_write~0 0))) (.cse15 (not (= ~p_dw_pc~0 0))) (.cse16 (not (= ~c_num_read~0 0))) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse22 (= ~p_dw_st~0 0)) (.cse19 (< 0 ~t1_pc~0)) (.cse5 (= ~m_pc~0 1)) (.cse29 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse30 (not .cse3)) (.cse17 (not (= ~q_free~0 1))) (.cse11 (not (= ~q_req_up~0 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse26 (= |old(~p_dw_st~0)| 0)) (.cse2 (not (= ~E_M~0 ~M_E~0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= ~q_free~0 0))) (.cse7 (not (= ~T1_E~0 ~M_E~0))) (.cse9 (= |old(~c_dr_st~0)| 0)) (.cse10 (not (= ~q_read_ev~0 2))) (.cse23 (not (= ~m_st~0 0))) (.cse8 (and .cse28 .cse20 .cse21)) (.cse24 (< ~E_1~0 2)) (.cse25 (not (= ~p_dw_i~0 1))) (.cse31 (< ~q_write_ev~0 2)) (.cse27 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse1 .cse12 .cse2 .cse13 .cse14 .cse15 .cse4 .cse5 .cse16 .cse7 .cse8 .cse17 .cse9 .cse10 .cse18) (or .cse11 .cse0 .cse19 .cse1 .cse12 .cse2 .cse13 .cse14 (and .cse20 .cse21 .cse22) .cse15 .cse4 .cse16 .cse7 .cse23 .cse24 .cse25 .cse17 (not .cse26) .cse10 .cse18 .cse27) (or .cse11 .cse0 .cse19 .cse1 .cse26 .cse2 .cse4 .cse6 .cse7 .cse23 (= ~q_write_ev~0 0) .cse8 .cse24 .cse25 .cse9 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse10 .cse27) (or .cse11 .cse0 (and (= ~q_read_ev~0 1) (not (= ~c_dr_st~0 0)) .cse22) .cse19 .cse1 .cse26 (and .cse28 .cse21) .cse2 .cse4 .cse5 .cse29 .cse7 .cse23 .cse30 .cse24 .cse25 .cse17 .cse9 .cse31 .cse27) (or .cse19 (and (or .cse11 .cse0 .cse1 .cse26 .cse2 .cse4 .cse5 .cse29 .cse7 .cse30 .cse17 .cse9 .cse10) (or .cse11 .cse0 .cse1 .cse26 .cse2 .cse4 .cse6 .cse7 .cse9 .cse10)) .cse23 .cse8 .cse24 .cse25 .cse31 .cse27)))) [2023-11-29 03:52:12,410 INFO L899 garLoopResultBuilder]: For program point L321-1(line 321) no Hoare annotation was computed. [2023-11-29 03:52:12,410 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 315 339) no Hoare annotation was computed. [2023-11-29 03:52:12,410 INFO L899 garLoopResultBuilder]: For program point L331(lines 331 335) no Hoare annotation was computed. [2023-11-29 03:52:12,410 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 315 339) the Hoare annotation is: (let ((.cse22 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse17 (not (= ~c_dr_pc~0 0))) (.cse18 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse19 (not (= ~p_num_write~0 0))) (.cse20 (not (= ~p_dw_pc~0 0))) (.cse26 (= ~m_pc~0 1)) (.cse21 (not (= ~c_num_read~0 0))) (.cse24 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse25 (= ~c_dr_pc~0 1)) (.cse23 (not (= ~q_free~0 1))) (.cse14 (< ~q_write_ev~0 2)) (.cse0 (not (= ~q_req_up~0 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (< 0 ~t1_pc~0)) (.cse3 (not (= ~M_E~0 2))) (.cse4 (= |old(~p_dw_st~0)| 0)) (.cse5 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse22)) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~q_free~0 0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse11 (< ~E_1~0 2)) (.cse12 (not (= ~p_dw_i~0 1))) (.cse13 (= |old(~c_dr_st~0)| 0)) (.cse15 (not (= ~q_read_ev~0 2))) (.cse16 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse17 .cse6 .cse18 .cse19 .cse20 .cse7 .cse21 .cse9 .cse10 (and .cse22 (= ~p_dw_st~0 0)) .cse11 .cse12 .cse23 (not .cse4) .cse15 .cse24 .cse16) (or .cse1 .cse3 .cse5 .cse6 .cse25 .cse7 .cse26 .cse8 .cse9 .cse13 .cse15) (or .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse18 .cse19 .cse20 .cse7 .cse26 .cse21 .cse9 .cse23 .cse13 .cse15 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~c_num_read~0 ~p_num_write~0)) .cse9 .cse10 (not .cse25) .cse11 .cse12 .cse23 .cse13 .cse14 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~q_write_ev~0 0) .cse11 .cse12 .cse13 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse15 .cse16)))) [2023-11-29 03:52:12,410 INFO L899 garLoopResultBuilder]: For program point L329(line 329) no Hoare annotation was computed. [2023-11-29 03:52:12,410 INFO L899 garLoopResultBuilder]: For program point L331-2(lines 315 339) no Hoare annotation was computed. [2023-11-29 03:52:12,410 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2023-11-29 03:52:12,410 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 634 641) no Hoare annotation was computed. [2023-11-29 03:52:12,410 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 634 641) the Hoare annotation is: true [2023-11-29 03:52:12,410 INFO L899 garLoopResultBuilder]: For program point L735-1(lines 734 757) no Hoare annotation was computed. [2023-11-29 03:52:12,411 INFO L899 garLoopResultBuilder]: For program point L750-1(lines 731 758) no Hoare annotation was computed. [2023-11-29 03:52:12,411 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 731 758) the Hoare annotation is: (let ((.cse18 (< ~t1_st~0 2)) (.cse4 (not (= ~t1_pc~0 1))) (.cse7 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0)))) (.cse3 (< ~m_st~0 2)) (.cse0 (not (= ~q_req_up~0 0))) (.cse20 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse21 (< 0 ~t1_pc~0)) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse5 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse6 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse12 (not (= ~q_free~0 0))) (.cse13 (< |old(~E_1~0)| 2)) (.cse14 (< |old(~E_M~0)| 2)) (.cse19 (not (= ~m_st~0 0))) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (< |old(~T1_E~0)| 2)) (.cse17 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 (not (= (+ ~local~0 1) ~token~0)) .cse15 .cse16) (or .cse0 .cse18 .cse20 .cse1 .cse21 .cse2 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse15 .cse16) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse21 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse20 .cse1 .cse21 .cse2 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse15 .cse16 .cse17))) [2023-11-29 03:52:12,411 INFO L899 garLoopResultBuilder]: For program point L745-1(lines 734 757) no Hoare annotation was computed. [2023-11-29 03:52:12,411 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 731 758) no Hoare annotation was computed. [2023-11-29 03:52:12,411 INFO L899 garLoopResultBuilder]: For program point L740-1(lines 734 757) no Hoare annotation was computed. [2023-11-29 03:52:12,411 INFO L899 garLoopResultBuilder]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2023-11-29 03:52:12,411 INFO L899 garLoopResultBuilder]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2023-11-29 03:52:12,411 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 279 296) the Hoare annotation is: (let ((.cse28 (= ~q_read_ev~0 2)) (.cse29 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse4 (< |old(~q_write_ev~0)| 2)) (.cse8 (and .cse29 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse22 (= ~m_pc~0 1)) (.cse26 (not (= ~q_free~0 0))) (.cse27 (and .cse29 .cse28)) (.cse1 (not (= ~q_req_up~0 0))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (< 0 ~t1_pc~0)) (.cse5 (not (= ~M_E~0 2))) (.cse17 (and (= ~q_write_ev~0 2) .cse28)) (.cse18 (not (= ~c_dr_pc~0 0))) (.cse19 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse20 (not (= ~p_num_write~0 0))) (.cse21 (not (= ~p_dw_pc~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse23 (not (= ~c_num_read~0 0))) (.cse10 (not (= ~T1_E~0 ~M_E~0))) (.cse11 (not (= ~m_st~0 0))) (.cse24 (not (= |old(~q_read_ev~0)| 2))) (.cse13 (< ~E_1~0 2)) (.cse14 (not (= ~p_dw_i~0 1))) (.cse15 (not (= ~q_free~0 1))) (.cse25 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~c_num_read~0 ~p_num_write~0)) .cse9 .cse10 .cse11 (not .cse12) .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse5 .cse17 .cse18 .cse19 .cse6 .cse20 .cse21 .cse7 .cse22 .cse23 .cse10 .cse24 .cse15 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse26 .cse9 .cse10 .cse11 .cse24 .cse13 .cse14 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse27 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse11 .cse24 .cse13 .cse14 .cse16) (or .cse0 .cse2 .cse5 .cse6 .cse12 .cse7 .cse22 .cse26 .cse10 .cse24 .cse27) (or .cse1 .cse2 (not .cse9) .cse3 .cse5 .cse17 .cse18 .cse19 .cse6 .cse20 .cse21 .cse7 .cse23 .cse10 .cse11 .cse24 .cse13 .cse14 .cse15 .cse25 .cse16)))) [2023-11-29 03:52:12,411 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 279 296) no Hoare annotation was computed. [2023-11-29 03:52:12,411 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2023-11-29 03:52:12,411 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 101) no Hoare annotation was computed. [2023-11-29 03:52:12,411 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 101) no Hoare annotation was computed. [2023-11-29 03:52:12,411 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 88 106) the Hoare annotation is: true [2023-11-29 03:52:12,411 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 88 106) no Hoare annotation was computed. [2023-11-29 03:52:12,412 INFO L899 garLoopResultBuilder]: For program point L103(lines 91 105) no Hoare annotation was computed. [2023-11-29 03:52:12,412 INFO L899 garLoopResultBuilder]: For program point L960(lines 960 966) no Hoare annotation was computed. [2023-11-29 03:52:12,412 INFO L895 garLoopResultBuilder]: At program point L927(line 927) the Hoare annotation is: (let ((.cse10 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~q_free~0 0)) (.cse20 (<= 2 ~m_st~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-29 03:52:12,412 INFO L899 garLoopResultBuilder]: For program point L927-1(line 927) no Hoare annotation was computed. [2023-11-29 03:52:12,412 INFO L899 garLoopResultBuilder]: For program point L250-1(lines 241 258) no Hoare annotation was computed. [2023-11-29 03:52:12,412 INFO L899 garLoopResultBuilder]: For program point L696-1(lines 686 724) no Hoare annotation was computed. [2023-11-29 03:52:12,412 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 572) no Hoare annotation was computed. [2023-11-29 03:52:12,412 INFO L899 garLoopResultBuilder]: For program point L878(lines 878 883) no Hoare annotation was computed. [2023-11-29 03:52:12,412 INFO L899 garLoopResultBuilder]: For program point L713(lines 713 720) no Hoare annotation was computed. [2023-11-29 03:52:12,412 INFO L899 garLoopResultBuilder]: For program point L713-2(lines 713 720) no Hoare annotation was computed. [2023-11-29 03:52:12,412 INFO L899 garLoopResultBuilder]: For program point L350(line 350) no Hoare annotation was computed. [2023-11-29 03:52:12,412 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 132 171) no Hoare annotation was computed. [2023-11-29 03:52:12,412 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse11 (= ~c_num_read~0 ~p_num_write~0)) (.cse13 (= ~q_free~0 1)) (.cse14 (<= 2 ~q_write_ev~0)) (.cse10 (<= 2 ~E_1~0)) (.cse19 (not (= ~p_dw_st~0 0))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse12 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= ~q_free~0 0)) (.cse15 (<= ~t1_pc~0 0)) (.cse16 (= ~q_req_up~0 0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse6 (= ~q_read_ev~0 2)) (.cse17 (= ~p_dw_i~0 1)) (.cse8 (= ~E_M~0 2)) (.cse18 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not .cse7) .cse8 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse13 .cse3 .cse14 .cse4 .cse15 .cse16 .cse7 .cse6 .cse17 .cse8 .cse18 .cse9) (and .cse10 .cse19 .cse0 .cse20 .cse1 .cse2 .cse12 .cse3 .cse14 .cse5 .cse15 .cse16 .cse7 .cse6 .cse17 .cse8 .cse18 .cse9) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse16 (= ~q_write_ev~0 2) .cse6 (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse8 .cse9) (and .cse10 .cse19 .cse11 .cse0 .cse1 .cse2 .cse12 .cse13 .cse3 .cse14 .cse4 .cse15 .cse16 .cse7 .cse17 .cse8 .cse18 .cse9) (and .cse10 .cse19 .cse0 .cse1 .cse2 .cse12 .cse14 .cse4 .cse5 .cse15 .cse16 .cse6 .cse17 .cse8 .cse18 .cse9) (and .cse10 .cse19 .cse0 .cse20 .cse1 (not (= ~q_write_ev~0 0)) .cse2 .cse12 .cse3 .cse4 .cse5 .cse15 .cse16 .cse7 .cse6 .cse17 .cse8 .cse18 .cse9))) [2023-11-29 03:52:12,413 INFO L895 garLoopResultBuilder]: At program point L912(line 912) the Hoare annotation is: (let ((.cse10 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~q_free~0 0)) (.cse20 (<= 2 ~m_st~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-29 03:52:12,413 INFO L899 garLoopResultBuilder]: For program point L400-1(line 400) no Hoare annotation was computed. [2023-11-29 03:52:12,413 INFO L899 garLoopResultBuilder]: For program point L912-1(line 912) no Hoare annotation was computed. [2023-11-29 03:52:12,413 INFO L899 garLoopResultBuilder]: For program point L846-1(lines 835 858) no Hoare annotation was computed. [2023-11-29 03:52:12,413 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 144) no Hoare annotation was computed. [2023-11-29 03:52:12,413 INFO L899 garLoopResultBuilder]: For program point L962(lines 962 965) no Hoare annotation was computed. [2023-11-29 03:52:12,413 INFO L895 garLoopResultBuilder]: At program point L897(line 897) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 0) (<= ~t1_pc~0 0) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2023-11-29 03:52:12,413 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2023-11-29 03:52:12,413 INFO L899 garLoopResultBuilder]: For program point L897-1(line 897) no Hoare annotation was computed. [2023-11-29 03:52:12,413 INFO L899 garLoopResultBuilder]: For program point L352-1(lines 347 387) no Hoare annotation was computed. [2023-11-29 03:52:12,413 INFO L899 garLoopResultBuilder]: For program point L699(lines 699 706) no Hoare annotation was computed. [2023-11-29 03:52:12,413 INFO L899 garLoopResultBuilder]: For program point L699-2(lines 699 706) no Hoare annotation was computed. [2023-11-29 03:52:12,413 INFO L899 garLoopResultBuilder]: For program point L567(lines 567 571) no Hoare annotation was computed. [2023-11-29 03:52:12,413 INFO L895 garLoopResultBuilder]: At program point L435(line 435) the Hoare annotation is: (let ((.cse16 (not (= ~m_pc~0 1))) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= ~c_num_read~0 ~p_num_write~0)) (.cse20 (= ~q_free~0 1)) (.cse17 (= ~c_dr_pc~0 1)) (.cse10 (= ~q_req_up~0 0)) (.cse18 (= ~q_req_up~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_st~0 0)) (.cse21 (<= 2 ~q_write_ev~0)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse8 (= ~q_free~0 0)) (.cse9 (<= ~t1_pc~0 0)) (.cse11 (= ~q_read_ev~0 2)) (.cse12 (= ~p_dw_i~0 1)) (.cse13 (= ~E_M~0 2)) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~q_write_ev~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse2 .cse4 .cse5 .cse16 .cse7 .cse8 .cse11 (not .cse17) .cse13 .cse15) (and .cse18 .cse0 .cse1 .cse19 .cse2 .cse4 .cse5 .cse6 .cse20 .cse21 .cse7 .cse9 .cse17 (<= 1 ~q_read_ev~0) .cse12 .cse22 .cse13 .cse14 .cse15) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse4 .cse5 .cse20 .cse16 .cse7 .cse10 (= ~q_write_ev~0 2) .cse11 (= ~c_dr_pc~0 0) .cse22 .cse13 .cse15) (and .cse0 .cse1 .cse19 .cse2 .cse4 .cse5 .cse6 .cse20 .cse21 .cse7 .cse9 .cse10 .cse17 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-11-29 03:52:12,413 INFO L899 garLoopResultBuilder]: For program point L435-1(line 435) no Hoare annotation was computed. [2023-11-29 03:52:12,413 INFO L899 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2023-11-29 03:52:12,414 INFO L899 garLoopResultBuilder]: For program point transmit1_returnLabel#1(lines 560 595) no Hoare annotation was computed. [2023-11-29 03:52:12,414 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 143) no Hoare annotation was computed. [2023-11-29 03:52:12,414 INFO L899 garLoopResultBuilder]: For program point L651-1(lines 642 659) no Hoare annotation was computed. [2023-11-29 03:52:12,414 INFO L895 garLoopResultBuilder]: At program point L585(line 585) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (<= 2 ~m_st~0)) (.cse9 (= ~q_req_up~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2023-11-29 03:52:12,414 INFO L899 garLoopResultBuilder]: For program point L585-1(line 585) no Hoare annotation was computed. [2023-11-29 03:52:12,414 INFO L895 garLoopResultBuilder]: At program point L420(line 420) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (<= ~t1_pc~0 0) (= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2023-11-29 03:52:12,414 INFO L899 garLoopResultBuilder]: For program point L420-1(line 420) no Hoare annotation was computed. [2023-11-29 03:52:12,414 INFO L895 garLoopResultBuilder]: At program point L899(line 899) the Hoare annotation is: (let ((.cse8 (= ~m_st~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~T1_E~0 2)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (<= ~t1_pc~0 0)) (.cse11 (= ~q_req_up~0 0)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~E_M~0 2)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~token~0 ~local~0) .cse16) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 (<= 2 ~m_st~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-29 03:52:12,414 INFO L895 garLoopResultBuilder]: At program point L899-1(line 899) the Hoare annotation is: (let ((.cse8 (= ~m_st~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~T1_E~0 2)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (<= ~t1_pc~0 0)) (.cse11 (= ~q_req_up~0 0)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~E_M~0 2)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~token~0 ~local~0) .cse16) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 (<= 2 ~m_st~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-29 03:52:12,414 INFO L899 garLoopResultBuilder]: For program point L189(lines 188 219) no Hoare annotation was computed. [2023-11-29 03:52:12,414 INFO L895 garLoopResultBuilder]: At program point L916(line 916) the Hoare annotation is: (let ((.cse10 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~q_free~0 0)) (.cse20 (<= 2 ~m_st~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-29 03:52:12,415 INFO L895 garLoopResultBuilder]: At program point L916-1(line 916) the Hoare annotation is: (let ((.cse10 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~q_free~0 0)) (.cse20 (<= 2 ~m_st~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-29 03:52:12,415 INFO L899 garLoopResultBuilder]: For program point start_simulation2_returnLabel#1(lines 889 947) no Hoare annotation was computed. [2023-11-29 03:52:12,415 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 218) no Hoare annotation was computed. [2023-11-29 03:52:12,415 INFO L899 garLoopResultBuilder]: For program point L520(lines 520 528) no Hoare annotation was computed. [2023-11-29 03:52:12,415 INFO L895 garLoopResultBuilder]: At program point L900(line 900) the Hoare annotation is: (let ((.cse8 (= ~m_st~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~T1_E~0 2)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (<= ~t1_pc~0 0)) (.cse11 (= ~q_req_up~0 0)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~E_M~0 2)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~token~0 ~local~0) .cse16) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 (<= 2 ~m_st~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-29 03:52:12,415 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 03:52:12,415 INFO L899 garLoopResultBuilder]: For program point master_returnLabel#1(lines 516 559) no Hoare annotation was computed. [2023-11-29 03:52:12,415 INFO L899 garLoopResultBuilder]: For program point L190-1(lines 190 200) no Hoare annotation was computed. [2023-11-29 03:52:12,415 INFO L895 garLoopResultBuilder]: At program point L537(line 537) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~q_req_up~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse6 (<= ~t1_pc~0 0) .cse7 .cse8 .cse9 .cse10 .cse11) (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~token~0 ~local~0)))) [2023-11-29 03:52:12,415 INFO L899 garLoopResultBuilder]: For program point L537-1(line 537) no Hoare annotation was computed. [2023-11-29 03:52:12,415 INFO L895 garLoopResultBuilder]: At program point L917(line 917) the Hoare annotation is: (let ((.cse10 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~q_free~0 0)) (.cse20 (<= 2 ~m_st~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-29 03:52:12,415 INFO L895 garLoopResultBuilder]: At program point L372(lines 347 387) the Hoare annotation is: (let ((.cse27 (= ~p_dw_st~0 0)) (.cse18 (= ~c_dr_pc~0 1))) (let ((.cse23 (= ~p_dw_pc~0 0)) (.cse24 (= ~p_num_write~0 0)) (.cse28 (= ~c_dr_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (= ~c_num_read~0 0)) (.cse26 (= ~q_write_ev~0 2)) (.cse7 (not .cse18)) (.cse13 (= ~c_num_read~0 ~p_num_write~0)) (.cse15 (= ~q_free~0 1)) (.cse10 (= ~q_req_up~0 1)) (.cse16 (<= 2 ~q_write_ev~0)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (not .cse27)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse29 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse14 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= ~q_free~0 0)) (.cse17 (<= ~t1_pc~0 0)) (.cse22 (= ~q_req_up~0 0)) (.cse6 (= ~q_read_ev~0 2)) (.cse19 (= ~p_dw_i~0 1)) (.cse8 (= ~E_M~0 2)) (.cse21 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse13 .cse0 .cse1 .cse2 .cse14 .cse15 .cse16 .cse4 .cse17 .cse18 (<= 1 ~q_read_ev~0) .cse19 .cse20 .cse8 .cse21 .cse9) (and .cse11 .cse13 .cse0 .cse1 .cse2 .cse14 .cse15 .cse3 .cse16 .cse4 .cse17 .cse22 .cse18 .cse6 .cse19 .cse8 .cse21 .cse9) (and .cse23 .cse11 .cse24 .cse25 .cse0 .cse1 .cse2 .cse14 .cse15 .cse17 .cse22 .cse26 .cse27 .cse6 .cse28 .cse19 .cse20 .cse8 .cse21 .cse9) (and .cse11 .cse12 .cse0 .cse29 .cse1 .cse2 .cse14 .cse3 .cse16 .cse5 .cse17 .cse22 .cse18 .cse6 .cse19 .cse8 .cse21 .cse9) (and .cse23 .cse24 .cse25 .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse22 .cse26 .cse6 .cse28 .cse20 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse25 .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|) .cse14 .cse5 .cse17 .cse26 .cse6 .cse7 .cse19 (= ~p_num_write~0 1) .cse8 .cse21 .cse9) (and .cse11 .cse12 .cse13 .cse0 .cse1 .cse2 .cse14 .cse15 .cse3 .cse16 .cse4 .cse17 .cse22 .cse18 .cse19 .cse8 .cse21 .cse9) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse14 .cse16 .cse4 .cse5 .cse17 .cse22 .cse6 .cse19 .cse8 .cse21 .cse9) (and .cse10 .cse11 .cse12 .cse0 .cse29 .cse1 .cse2 .cse14 .cse16 .cse4 .cse5 .cse17 .cse6 .cse19 .cse8 .cse21 .cse9) (and .cse11 .cse12 .cse0 .cse29 .cse1 (not (= ~q_write_ev~0 0)) .cse2 .cse14 .cse3 .cse4 .cse5 .cse17 .cse22 .cse18 .cse6 .cse19 .cse8 .cse21 .cse9)))) [2023-11-29 03:52:12,416 INFO L899 garLoopResultBuilder]: For program point L851-1(lines 832 859) no Hoare annotation was computed. [2023-11-29 03:52:12,416 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2023-11-29 03:52:12,416 INFO L895 garLoopResultBuilder]: At program point L422(line 422) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~q_free~0 1)) (.cse7 (= ~q_req_up~0 0)) (.cse8 (= ~q_write_ev~0 2)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= ~E_M~0 2)) (.cse13 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 (<= ~t1_pc~0 0) .cse7 .cse8 (= ~p_dw_st~0 0) .cse9 .cse10 (= ~p_dw_i~0 1) .cse11 .cse12 (= ~token~0 ~local~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) (not (= ~c_dr_st~0 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2023-11-29 03:52:12,416 INFO L895 garLoopResultBuilder]: At program point L422-1(line 422) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~q_free~0 1)) (.cse7 (= ~q_req_up~0 0)) (.cse8 (= ~q_write_ev~0 2)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= ~E_M~0 2)) (.cse13 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 (<= ~t1_pc~0 0) .cse7 .cse8 (= ~p_dw_st~0 0) .cse9 .cse10 (= ~p_dw_i~0 1) .cse11 .cse12 (= ~token~0 ~local~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) (not (= ~c_dr_st~0 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2023-11-29 03:52:12,416 INFO L895 garLoopResultBuilder]: At program point L439(line 439) the Hoare annotation is: (let ((.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~q_free~0 1)) (.cse7 (= ~c_dr_pc~0 1)) (.cse15 (<= 2 ~q_write_ev~0)) (.cse12 (<= 2 ~E_1~0)) (.cse13 (not (= ~p_dw_st~0 0))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse14 (= ~m_st~0 0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= ~q_free~0 0)) (.cse16 (<= ~t1_pc~0 0)) (.cse11 (= ~q_req_up~0 0)) (.cse6 (= ~q_read_ev~0 2)) (.cse17 (= ~p_dw_i~0 1)) (.cse8 (= ~E_M~0 2)) (.cse18 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not .cse7) .cse8 .cse9) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse10 .cse3 .cse4 .cse11 (= ~q_write_ev~0 2) .cse6 (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse8 .cse9) (and .cse12 .cse13 (= ~c_num_read~0 ~p_num_write~0) .cse0 .cse1 .cse2 .cse14 .cse10 .cse15 .cse4 .cse16 .cse11 .cse7 .cse17 .cse8 .cse18 .cse9) (and .cse12 .cse13 .cse0 .cse1 .cse2 .cse14 .cse15 .cse4 .cse5 .cse16 .cse11 .cse6 .cse17 .cse8 .cse18 .cse9) (and .cse12 .cse13 .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2 .cse14 .cse4 .cse5 .cse16 .cse11 .cse6 .cse17 .cse8 .cse18 .cse9))) [2023-11-29 03:52:12,416 INFO L895 garLoopResultBuilder]: At program point L439-1(line 439) the Hoare annotation is: (let ((.cse15 (not (= ~m_pc~0 1))) (.cse17 (= ~q_free~0 1)) (.cse16 (= ~c_dr_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse5 (= ~m_st~0 0)) (.cse18 (<= 2 ~q_write_ev~0)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= ~q_free~0 0)) (.cse8 (<= ~t1_pc~0 0)) (.cse9 (= ~q_req_up~0 0)) (.cse10 (= ~q_read_ev~0 2)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~E_M~0 2)) (.cse13 (= ~token~0 ~local~0)) (.cse14 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 (not (= ~q_write_ev~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse10 (not .cse16) .cse12 .cse14) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse17 .cse15 .cse6 .cse9 (= ~q_write_ev~0 2) .cse10 (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse12 .cse14) (and .cse0 .cse1 (= ~c_num_read~0 ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse17 .cse18 .cse6 .cse8 .cse9 .cse16 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2023-11-29 03:52:12,416 INFO L899 garLoopResultBuilder]: For program point start_simulation1_returnLabel#1(lines 413 455) no Hoare annotation was computed. [2023-11-29 03:52:12,416 INFO L895 garLoopResultBuilder]: At program point L918(line 918) the Hoare annotation is: (let ((.cse10 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~q_free~0 0)) (.cse20 (<= 2 ~m_st~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-29 03:52:12,416 INFO L899 garLoopResultBuilder]: For program point L885(lines 874 887) no Hoare annotation was computed. [2023-11-29 03:52:12,417 INFO L895 garLoopResultBuilder]: At program point L687(line 687) the Hoare annotation is: (let ((.cse10 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~q_free~0 0)) (.cse20 (<= 2 ~m_st~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-29 03:52:12,417 INFO L895 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~q_free~0 1)) (.cse7 (= ~q_req_up~0 0)) (.cse8 (= ~q_write_ev~0 2)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= ~E_M~0 2)) (.cse13 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 (<= ~t1_pc~0 0) .cse7 .cse8 (= ~p_dw_st~0 0) .cse9 .cse10 (= ~p_dw_i~0 1) .cse11 .cse12 (= ~token~0 ~local~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) (not (= ~c_dr_st~0 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2023-11-29 03:52:12,417 INFO L899 garLoopResultBuilder]: For program point L357(lines 347 387) no Hoare annotation was computed. [2023-11-29 03:52:12,417 INFO L899 garLoopResultBuilder]: For program point L836(lines 836 840) no Hoare annotation was computed. [2023-11-29 03:52:12,417 INFO L899 garLoopResultBuilder]: For program point L836-2(lines 835 858) no Hoare annotation was computed. [2023-11-29 03:52:12,417 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse13 (<= 1 ~q_write_ev~0)) (.cse17 (= ~c_num_read~0 ~p_num_write~0)) (.cse18 (= ~q_free~0 1)) (.cse20 (<= 2 ~q_write_ev~0)) (.cse10 (<= 2 ~E_1~0)) (.cse16 (not (= ~p_dw_st~0 0))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse11 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= ~q_free~0 0)) (.cse12 (<= ~t1_pc~0 0)) (.cse19 (= ~q_req_up~0 0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse6 (= ~q_read_ev~0 2)) (.cse14 (= ~p_dw_i~0 1)) (.cse8 (= ~E_M~0 2)) (.cse15 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not .cse7) .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (or (and .cse16 .cse17 .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse19 .cse7 .cse6 .cse8 .cse9) (and .cse16 .cse0 .cse1 .cse2 .cse4 .cse5 .cse19 .cse6 .cse8 .cse9))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse19 (= ~q_write_ev~0 2) .cse6 (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse8 .cse9) (and .cse10 .cse16 .cse17 .cse0 .cse1 .cse2 .cse11 .cse18 .cse3 .cse20 .cse4 .cse12 .cse19 .cse7 .cse14 .cse8 .cse15 .cse9) (and .cse10 .cse16 .cse0 .cse21 .cse1 .cse2 .cse11 .cse3 .cse5 .cse12 .cse19 .cse7 .cse13 .cse6 .cse14 .cse8 .cse15 .cse9) (and .cse10 .cse17 .cse0 .cse1 .cse2 .cse11 .cse18 (= ~q_read_ev~0 1) .cse3 .cse20 .cse4 .cse12 .cse19 .cse7 .cse14 .cse8 .cse15 .cse9) (and .cse10 .cse16 .cse0 .cse21 .cse1 (not (= ~q_write_ev~0 0)) .cse2 .cse11 .cse3 .cse4 .cse5 .cse12 .cse19 .cse7 .cse6 .cse14 .cse8 .cse15 .cse9))) [2023-11-29 03:52:12,417 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2023-11-29 03:52:12,417 INFO L899 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2023-11-29 03:52:12,417 INFO L899 garLoopResultBuilder]: For program point eval2_returnLabel#1(lines 680 730) no Hoare annotation was computed. [2023-11-29 03:52:12,417 INFO L899 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2023-11-29 03:52:12,417 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 185) no Hoare annotation was computed. [2023-11-29 03:52:12,417 INFO L899 garLoopResultBuilder]: For program point L689(line 689) no Hoare annotation was computed. [2023-11-29 03:52:12,417 INFO L895 garLoopResultBuilder]: At program point L904-1(lines 904 941) the Hoare annotation is: (let ((.cse10 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~q_free~0 0)) (.cse20 (<= 2 ~m_st~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-29 03:52:12,418 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 173 225) no Hoare annotation was computed. [2023-11-29 03:52:12,418 INFO L899 garLoopResultBuilder]: For program point L409(lines 398 411) no Hoare annotation was computed. [2023-11-29 03:52:12,418 INFO L899 garLoopResultBuilder]: For program point L921(line 921) no Hoare annotation was computed. [2023-11-29 03:52:12,418 INFO L899 garLoopResultBuilder]: For program point L376(lines 376 383) no Hoare annotation was computed. [2023-11-29 03:52:12,418 INFO L895 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: false [2023-11-29 03:52:12,418 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 03:52:12,418 INFO L895 garLoopResultBuilder]: At program point L575-1(lines 575 588) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse13 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~q_req_up~0 0)) (.cse9 (<= 2 ~T1_E~0)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~m_st~0) .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 (not (= ~m_pc~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 (= (+ ~local~0 1) ~token~0) .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2023-11-29 03:52:12,418 INFO L899 garLoopResultBuilder]: For program point L245(lines 245 249) no Hoare annotation was computed. [2023-11-29 03:52:12,418 INFO L899 garLoopResultBuilder]: For program point L245-2(lines 244 257) no Hoare annotation was computed. [2023-11-29 03:52:12,418 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2023-11-29 03:52:12,418 INFO L899 garLoopResultBuilder]: For program point L691-1(lines 686 724) no Hoare annotation was computed. [2023-11-29 03:52:12,418 INFO L895 garLoopResultBuilder]: At program point L427-1(lines 427 449) the Hoare annotation is: (let ((.cse23 (= ~p_dw_st~0 0))) (let ((.cse19 (= ~p_dw_pc~0 0)) (.cse20 (= ~p_num_write~0 0)) (.cse21 (= ~c_num_read~0 0)) (.cse22 (= ~q_write_ev~0 2)) (.cse24 (= ~c_dr_pc~0 0)) (.cse25 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~c_num_read~0 ~p_num_write~0)) (.cse13 (= ~q_free~0 1)) (.cse14 (<= 2 ~q_write_ev~0)) (.cse10 (<= 2 ~E_1~0)) (.cse26 (not .cse23)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse27 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse12 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= ~q_free~0 0)) (.cse15 (<= ~t1_pc~0 0)) (.cse16 (= ~q_req_up~0 0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse6 (= ~q_read_ev~0 2)) (.cse17 (= ~p_dw_i~0 1)) (.cse8 (= ~E_M~0 2)) (.cse18 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not .cse7) .cse8 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse13 .cse3 .cse14 .cse4 .cse15 .cse16 .cse7 .cse6 .cse17 .cse8 .cse18 .cse9) (and .cse19 .cse10 .cse20 .cse21 .cse0 .cse1 .cse2 .cse12 .cse13 .cse15 .cse16 .cse22 .cse23 .cse6 .cse24 .cse17 .cse25 .cse8 .cse18 .cse9) (and .cse10 .cse26 .cse0 .cse27 .cse1 .cse2 .cse12 .cse3 .cse14 .cse5 .cse15 .cse16 .cse7 .cse6 .cse17 .cse8 .cse18 .cse9) (and .cse19 .cse20 .cse21 .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse16 .cse22 .cse6 .cse24 .cse25 .cse8 .cse9) (and .cse10 .cse26 .cse11 .cse0 .cse1 .cse2 .cse12 .cse13 .cse3 .cse14 .cse4 .cse15 .cse16 .cse7 .cse17 .cse8 .cse18 .cse9) (and .cse10 .cse26 .cse0 .cse1 .cse2 .cse12 .cse14 .cse4 .cse5 .cse15 .cse16 .cse6 .cse17 .cse8 .cse18 .cse9) (and .cse10 .cse26 .cse0 .cse27 .cse1 (not (= ~q_write_ev~0 0)) .cse2 .cse12 .cse3 .cse4 .cse5 .cse15 .cse16 .cse7 .cse6 .cse17 .cse8 .cse18 .cse9)))) [2023-11-29 03:52:12,418 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 368) no Hoare annotation was computed. [2023-11-29 03:52:12,418 INFO L899 garLoopResultBuilder]: For program point eval1_returnLabel#1(lines 340 393) no Hoare annotation was computed. [2023-11-29 03:52:12,418 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2023-11-29 03:52:12,418 INFO L899 garLoopResultBuilder]: For program point L923(lines 923 932) no Hoare annotation was computed. [2023-11-29 03:52:12,418 INFO L899 garLoopResultBuilder]: For program point L923-2(lines 923 932) no Hoare annotation was computed. [2023-11-29 03:52:12,419 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 184) no Hoare annotation was computed. [2023-11-29 03:52:12,419 INFO L895 garLoopResultBuilder]: At program point L147-1(lines 147 165) the Hoare annotation is: (let ((.cse27 (= ~c_dr_pc~0 1))) (let ((.cse18 (not .cse27)) (.cse19 (= ~q_req_up~0 1)) (.cse9 (= ~q_free~0 0)) (.cse17 (not (= ~m_pc~0 1))) (.cse7 (<= 2 ~q_write_ev~0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse22 (= ~p_dw_pc~0 0)) (.cse0 (<= 2 ~E_1~0)) (.cse23 (= ~p_num_write~0 0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse20 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse5 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse6 (= ~m_st~0 0)) (.cse24 (= ~q_free~0 1)) (.cse10 (<= ~t1_pc~0 0)) (.cse11 (= ~q_req_up~0 0)) (.cse21 (= ~q_write_ev~0 2)) (.cse12 (= ~q_read_ev~0 2)) (.cse25 (= ~c_dr_pc~0 0)) (.cse13 (= ~p_dw_i~0 1)) (.cse26 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~E_M~0 2)) (.cse15 (= ~token~0 ~local~0)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse2 .cse3 .cse4 .cse17 .cse8 .cse9 .cse12 .cse18 .cse14 .cse16) (and .cse19 .cse0 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse9 .cse10 .cse21 .cse12 .cse18 .cse13 (= ~p_num_write~0 1) .cse14 .cse15 .cse16) (and .cse19 .cse0 .cse1 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse22 .cse23 .cse20 .cse2 .cse3 .cse4 .cse24 .cse17 .cse8 .cse11 .cse21 .cse12 .cse25 .cse26 .cse14 .cse16) (and .cse0 .cse1 (= ~c_num_read~0 ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse10 .cse27 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse22 .cse0 .cse23 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse10 .cse11 .cse21 .cse12 .cse25 .cse13 .cse26 .cse14 .cse15 .cse16)))) [2023-11-29 03:52:12,419 INFO L899 garLoopResultBuilder]: For program point L841-1(lines 835 858) no Hoare annotation was computed. [2023-11-29 03:52:12,419 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 496) no Hoare annotation was computed. [2023-11-29 03:52:12,419 INFO L899 garLoopResultBuilder]: For program point L148(lines 147 165) no Hoare annotation was computed. [2023-11-29 03:52:12,419 INFO L895 garLoopResultBuilder]: At program point L710-1(lines 686 724) the Hoare annotation is: (let ((.cse10 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~q_free~0 0)) (.cse20 (<= 2 ~m_st~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-29 03:52:12,419 INFO L899 garLoopResultBuilder]: For program point $Ultimate##101(lines 545 551) no Hoare annotation was computed. [2023-11-29 03:52:12,420 INFO L895 garLoopResultBuilder]: At program point L545-1(lines 531 552) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0 1)) (.cse14 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~q_req_up~0 0)) (.cse9 (<= 2 ~T1_E~0)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse0 .cse1 .cse2 .cse3 (= (+ ~local~0 1) ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~token~0 ~local~0)))) [2023-11-29 03:52:12,420 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 157) no Hoare annotation was computed. [2023-11-29 03:52:12,420 INFO L899 garLoopResultBuilder]: For program point L496(line 496) no Hoare annotation was computed. [2023-11-29 03:52:12,420 INFO L895 garLoopResultBuilder]: At program point L876(line 876) the Hoare annotation is: (let ((.cse10 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~q_free~0 0)) (.cse20 (<= 2 ~m_st~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-29 03:52:12,420 INFO L899 garLoopResultBuilder]: For program point L876-1(line 876) no Hoare annotation was computed. [2023-11-29 03:52:12,420 INFO L895 garLoopResultBuilder]: At program point L348(line 348) the Hoare annotation is: (let ((.cse27 (= ~p_dw_st~0 0)) (.cse18 (= ~c_dr_pc~0 1))) (let ((.cse23 (= ~p_dw_pc~0 0)) (.cse24 (= ~p_num_write~0 0)) (.cse28 (= ~c_dr_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (= ~c_num_read~0 0)) (.cse26 (= ~q_write_ev~0 2)) (.cse7 (not .cse18)) (.cse13 (= ~c_num_read~0 ~p_num_write~0)) (.cse15 (= ~q_free~0 1)) (.cse10 (= ~q_req_up~0 1)) (.cse16 (<= 2 ~q_write_ev~0)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (not .cse27)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse29 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse14 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= ~q_free~0 0)) (.cse17 (<= ~t1_pc~0 0)) (.cse22 (= ~q_req_up~0 0)) (.cse6 (= ~q_read_ev~0 2)) (.cse19 (= ~p_dw_i~0 1)) (.cse8 (= ~E_M~0 2)) (.cse21 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse13 .cse0 .cse1 .cse2 .cse14 .cse15 .cse16 .cse4 .cse17 .cse18 (<= 1 ~q_read_ev~0) .cse19 .cse20 .cse8 .cse21 .cse9) (and .cse11 .cse13 .cse0 .cse1 .cse2 .cse14 .cse15 .cse3 .cse16 .cse4 .cse17 .cse22 .cse18 .cse6 .cse19 .cse8 .cse21 .cse9) (and .cse23 .cse11 .cse24 .cse25 .cse0 .cse1 .cse2 .cse14 .cse15 .cse17 .cse22 .cse26 .cse27 .cse6 .cse28 .cse19 .cse20 .cse8 .cse21 .cse9) (and .cse11 .cse12 .cse0 .cse29 .cse1 .cse2 .cse14 .cse3 .cse16 .cse5 .cse17 .cse22 .cse18 .cse6 .cse19 .cse8 .cse21 .cse9) (and .cse23 .cse24 .cse25 .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse22 .cse26 .cse6 .cse28 .cse20 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse25 .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|) .cse14 .cse5 .cse17 .cse26 .cse6 .cse7 .cse19 (= ~p_num_write~0 1) .cse8 .cse21 .cse9) (and .cse11 .cse12 .cse13 .cse0 .cse1 .cse2 .cse14 .cse15 .cse3 .cse16 .cse4 .cse17 .cse22 .cse18 .cse19 .cse8 .cse21 .cse9) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse14 .cse16 .cse4 .cse5 .cse17 .cse22 .cse6 .cse19 .cse8 .cse21 .cse9) (and .cse10 .cse11 .cse12 .cse0 .cse29 .cse1 .cse2 .cse14 .cse16 .cse4 .cse5 .cse17 .cse6 .cse19 .cse8 .cse21 .cse9) (and .cse11 .cse12 .cse0 .cse29 .cse1 (not (= ~q_write_ev~0 0)) .cse2 .cse14 .cse3 .cse4 .cse5 .cse17 .cse22 .cse18 .cse6 .cse19 .cse8 .cse21 .cse9)))) [2023-11-29 03:52:12,421 INFO L895 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: false [2023-11-29 03:52:12,421 INFO L895 garLoopResultBuilder]: At program point L216-1(lines 188 219) the Hoare annotation is: (let ((.cse19 (= ~c_dr_pc~0 1)) (.cse22 (= ~p_dw_st~0 0))) (let ((.cse0 (= ~q_req_up~0 1)) (.cse2 (not .cse22)) (.cse1 (<= 2 ~E_1~0)) (.cse20 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~T1_E~0 2)) (.cse7 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse8 (= ~m_st~0 0)) (.cse9 (= ~q_free~0 1)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (= ~q_write_ev~0 2)) (.cse13 (= ~q_read_ev~0 2)) (.cse21 (not .cse19)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~E_M~0 2)) (.cse17 (= ~token~0 ~local~0)) (.cse18 (= ~M_E~0 2))) (or (and (<= 2 ~q_write_ev~0) (let ((.cse3 (= ~c_num_read~0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse14 .cse15 .cse16 .cse17 .cse18))) (<= 1 ~q_read_ev~0)) (and .cse0 .cse1 .cse2 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 (= ~q_free~0 0) .cse11 .cse12 .cse13 .cse21 .cse14 (= ~p_num_write~0 1) .cse16 .cse17 .cse18) (and (= ~p_dw_pc~0 0) .cse1 (= ~p_num_write~0 0) .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~q_req_up~0 0) .cse12 .cse22 .cse13 .cse21 .cse14 .cse15 .cse16 .cse17 .cse18)))) [2023-11-29 03:52:12,421 INFO L899 garLoopResultBuilder]: For program point L646(lines 646 650) no Hoare annotation was computed. [2023-11-29 03:52:12,421 INFO L899 garLoopResultBuilder]: For program point L646-2(lines 645 658) no Hoare annotation was computed. [2023-11-29 03:52:12,421 INFO L899 garLoopResultBuilder]: For program point L84(lines 72 86) no Hoare annotation was computed. [2023-11-29 03:52:12,421 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 69 87) no Hoare annotation was computed. [2023-11-29 03:52:12,421 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 79) no Hoare annotation was computed. [2023-11-29 03:52:12,421 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 69 87) the Hoare annotation is: true [2023-11-29 03:52:12,421 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 82) no Hoare annotation was computed. [2023-11-29 03:52:12,422 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 73 82) no Hoare annotation was computed. [2023-11-29 03:52:12,422 INFO L899 garLoopResultBuilder]: For program point L275(lines 262 277) no Hoare annotation was computed. [2023-11-29 03:52:12,422 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 272) no Hoare annotation was computed. [2023-11-29 03:52:12,422 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 259 278) the Hoare annotation is: true [2023-11-29 03:52:12,422 INFO L899 garLoopResultBuilder]: For program point L263(lines 263 273) no Hoare annotation was computed. [2023-11-29 03:52:12,422 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 259 278) no Hoare annotation was computed. [2023-11-29 03:52:12,422 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 24 31) the Hoare annotation is: true [2023-11-29 03:52:12,422 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 28) no Hoare annotation was computed. [2023-11-29 03:52:12,422 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 24 31) no Hoare annotation was computed. [2023-11-29 03:52:12,422 INFO L899 garLoopResultBuilder]: For program point L668(lines 668 673) no Hoare annotation was computed. [2023-11-29 03:52:12,422 INFO L899 garLoopResultBuilder]: For program point L664(lines 664 674) no Hoare annotation was computed. [2023-11-29 03:52:12,422 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 660 679) the Hoare annotation is: true [2023-11-29 03:52:12,423 INFO L899 garLoopResultBuilder]: For program point L676(lines 663 678) no Hoare annotation was computed. [2023-11-29 03:52:12,423 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 660 679) no Hoare annotation was computed. [2023-11-29 03:52:12,423 INFO L899 garLoopResultBuilder]: For program point L306-1(lines 297 314) no Hoare annotation was computed. [2023-11-29 03:52:12,423 INFO L899 garLoopResultBuilder]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2023-11-29 03:52:12,423 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 297 314) the Hoare annotation is: (let ((.cse32 (= ~c_dr_pc~0 1)) (.cse30 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse33 (= ~q_read_ev~0 2))) (let ((.cse3 (< |old(~q_write_ev~0)| 1)) (.cse16 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse8 (not (= ~q_free~0 0))) (.cse17 (and .cse30 .cse33)) (.cse20 (and (= ~q_write_ev~0 2) .cse33)) (.cse21 (not (= ~c_dr_pc~0 0))) (.cse22 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse23 (not (= ~p_num_write~0 0))) (.cse24 (not (= ~p_dw_pc~0 0))) (.cse25 (not (= ~c_num_read~0 0))) (.cse12 (not (= |old(~q_read_ev~0)| 2))) (.cse27 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse19 (= ~c_dr_st~0 0)) (.cse0 (not (= ~q_req_up~0 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (< 0 ~t1_pc~0)) (.cse31 (< |old(~q_write_ev~0)| 2)) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (= ~m_pc~0 1)) (.cse28 (and .cse30 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse29 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (not (= ~T1_E~0 ~M_E~0))) (.cse11 (not (= ~m_st~0 0))) (.cse13 (not .cse32)) (.cse14 (< ~E_1~0 2)) (.cse15 (not (= ~p_dw_i~0 1))) (.cse26 (not (= ~q_free~0 1))) (.cse18 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse19 .cse0 .cse1 .cse4 .cse20 .cse21 .cse22 .cse5 .cse23 .cse24 .cse6 .cse7 .cse25 .cse10 .cse12 .cse26 .cse27) (or .cse2 .cse3 .cse28 .cse11 (and (or .cse19 .cse0 .cse1 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12) (or .cse19 .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse12 .cse13 .cse26)) .cse14 .cse15 .cse18) (or .cse19 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= |old(~q_write_ev~0)| 0) .cse16 .cse17 .cse18) (or .cse19 .cse0 .cse1 .cse2 (and (= ~q_read_ev~0 1) .cse30) .cse31 .cse4 .cse5 .cse6 .cse29 .cse10 .cse11 (not (= |old(~q_read_ev~0)| 1)) .cse13 .cse14 .cse15 .cse26 .cse18) (or .cse19 .cse1 .cse4 .cse5 .cse32 .cse6 .cse7 .cse8 .cse10 .cse12 .cse17) (or .cse0 .cse1 (not .cse9) .cse2 .cse4 .cse20 .cse21 .cse22 .cse5 .cse23 .cse24 .cse6 .cse25 .cse10 .cse11 .cse12 .cse14 .cse15 .cse26 .cse27 .cse18) (or .cse19 .cse0 .cse1 .cse2 .cse31 .cse4 .cse5 .cse6 .cse7 .cse28 .cse29 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse26 .cse18)))) [2023-11-29 03:52:12,423 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 297 314) no Hoare annotation was computed. [2023-11-29 03:52:12,423 INFO L899 garLoopResultBuilder]: For program point L768-1(lines 762 785) no Hoare annotation was computed. [2023-11-29 03:52:12,423 INFO L899 garLoopResultBuilder]: For program point L763-1(lines 762 785) no Hoare annotation was computed. [2023-11-29 03:52:12,424 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 759 786) no Hoare annotation was computed. [2023-11-29 03:52:12,424 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 759 786) the Hoare annotation is: (let ((.cse18 (< ~t1_st~0 2)) (.cse4 (not (= ~t1_pc~0 1))) (.cse7 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0)))) (.cse3 (< ~m_st~0 2)) (.cse0 (not (= ~q_req_up~0 0))) (.cse20 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse21 (< 0 ~t1_pc~0)) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse5 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse6 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse12 (not (= ~q_free~0 0))) (.cse13 (< |old(~E_1~0)| 2)) (.cse14 (< |old(~E_M~0)| 2)) (.cse19 (not (= ~m_st~0 0))) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (< |old(~T1_E~0)| 2)) (.cse17 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 (not (= (+ ~local~0 1) ~token~0)) .cse15 .cse16) (or .cse0 .cse18 .cse20 .cse1 .cse21 .cse2 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse15 .cse16) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse21 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse20 .cse1 .cse21 .cse2 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse15 .cse16 .cse17))) [2023-11-29 03:52:12,424 INFO L899 garLoopResultBuilder]: For program point L778-1(lines 759 786) no Hoare annotation was computed. [2023-11-29 03:52:12,424 INFO L899 garLoopResultBuilder]: For program point L773-1(lines 762 785) no Hoare annotation was computed. [2023-11-29 03:52:12,427 INFO L445 BasicCegarLoop]: Path program 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] [2023-11-29 03:52:12,429 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 03:52:12,451 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 03:52:12,453 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 03:52:12,453 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 03:52:12,454 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 03:52:12,457 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 03:52:12,458 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 03:52:12,459 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 03:52:12,460 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 03:52:12,460 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 03:52:12,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 03:52:12 BoogieIcfgContainer [2023-11-29 03:52:12,481 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 03:52:12,481 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 03:52:12,481 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 03:52:12,481 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 03:52:12,482 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:50:22" (3/4) ... [2023-11-29 03:52:12,484 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 03:52:12,488 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2023-11-29 03:52:12,488 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2023-11-29 03:52:12,488 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2023-11-29 03:52:12,488 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2023-11-29 03:52:12,488 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2023-11-29 03:52:12,489 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2023-11-29 03:52:12,489 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2023-11-29 03:52:12,489 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2023-11-29 03:52:12,489 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2023-11-29 03:52:12,489 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2023-11-29 03:52:12,489 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2023-11-29 03:52:12,490 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2023-11-29 03:52:12,490 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2023-11-29 03:52:12,490 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2023-11-29 03:52:12,502 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2023-11-29 03:52:12,503 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-11-29 03:52:12,505 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 03:52:12,506 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 03:52:12,656 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 03:52:12,656 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 03:52:12,656 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 03:52:12,657 INFO L158 Benchmark]: Toolchain (without parser) took 111116.26ms. Allocated memory was 153.1MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 117.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 890.3MB. Max. memory is 16.1GB. [2023-11-29 03:52:12,657 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 107.0MB. Free memory is still 60.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:52:12,658 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.18ms. Allocated memory is still 153.1MB. Free memory was 116.5MB in the beginning and 99.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 03:52:12,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.14ms. Allocated memory is still 153.1MB. Free memory was 99.7MB in the beginning and 96.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:52:12,658 INFO L158 Benchmark]: Boogie Preprocessor took 57.92ms. Allocated memory is still 153.1MB. Free memory was 96.9MB in the beginning and 94.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 03:52:12,659 INFO L158 Benchmark]: RCFGBuilder took 549.85ms. Allocated memory is still 153.1MB. Free memory was 94.1MB in the beginning and 62.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-11-29 03:52:12,659 INFO L158 Benchmark]: TraceAbstraction took 109903.57ms. Allocated memory was 153.1MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 61.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-11-29 03:52:12,659 INFO L158 Benchmark]: Witness Printer took 175.43ms. Allocated memory is still 2.5GB. Free memory was 1.6GB in the beginning and 1.5GB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 03:52:12,661 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.20ms. Allocated memory is still 107.0MB. Free memory is still 60.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.18ms. Allocated memory is still 153.1MB. Free memory was 116.5MB in the beginning and 99.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.14ms. Allocated memory is still 153.1MB. Free memory was 99.7MB in the beginning and 96.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.92ms. Allocated memory is still 153.1MB. Free memory was 96.9MB in the beginning and 94.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 549.85ms. Allocated memory is still 153.1MB. Free memory was 94.1MB in the beginning and 62.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 109903.57ms. Allocated memory was 153.1MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 61.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 175.43ms. Allocated memory is still 2.5GB. Free memory was 1.6GB in the beginning and 1.5GB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 496]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 28]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 186 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 109.8s, OverallIterations: 34, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 30.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 54.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16687 SdHoareTripleChecker+Valid, 12.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16286 mSDsluCounter, 18600 SdHoareTripleChecker+Invalid, 10.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12593 mSDsCounter, 3805 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16329 IncrementalHoareTripleChecker+Invalid, 20134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3805 mSolverCounterUnsat, 6007 mSDtfsCounter, 16329 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3381 GetRequests, 2946 SyntacticMatches, 5 SemanticMatches, 430 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1446 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11796occurred in iteration=23, InterpolantAutomatonStates: 383, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 7613 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 50 LocationsWithAnnotation, 8611 PreInvPairs, 9181 NumberOfFragments, 14482 HoareAnnotationTreeSize, 8611 FomulaSimplifications, 364701 FormulaSimplificationTreeSizeReduction, 30.8s HoareSimplificationTime, 50 FomulaSimplificationsInter, 126849 FormulaSimplificationTreeSizeReductionInter, 23.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 4937 NumberOfCodeBlocks, 4937 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 5331 ConstructedInterpolants, 0 QuantifiedInterpolants, 9551 SizeOfPredicates, 3 NumberOfNonLiveVariables, 6125 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 51 InterpolantComputations, 31 PerfectInterpolantSequences, 2555/2756 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 575]: Loop Invariant Derived loop invariant: ((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) || ((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) - InvariantResult [Line: 904]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) || (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((((2 <= q_write_ev) && (((((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2)) || (((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2)))) && (1 <= q_read_ev)) || (((((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (p_num_write == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || (((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (q_req_up == 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2))) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2)) || ((((((((((p_last_write == q_buf_0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_free == 0)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (E_M == 2)) && (M_E == 2))) || (((((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (t1_pc <= 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (p_num_write == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || (((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_req_up == 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (M_E == 2))) || (((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_pc <= 0)) && (q_req_up == 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2))) - InvariantResult [Line: 531]: Loop Invariant Derived loop invariant: (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) - InvariantResult [Line: 686]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) || (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) - InvariantResult [Line: 427]: Loop Invariant Derived loop invariant: (((((((((((((((((p_last_write == q_buf_0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_free == 0)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (E_M == 2)) && (M_E == 2)) || ((((((((((((((((((2 <= E_1) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_pc <= 0)) && (q_req_up == 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && !((m_pc == 1))) && (2 <= q_write_ev)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_req_up == 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (M_E == 2))) || ((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || (((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && !((q_write_ev == 0))) && (T1_E == 2)) && (m_st == 0)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((((((((((((((p_last_write == q_buf_0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_free == 0)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (E_M == 2)) && (M_E == 2)) || (((((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((2 <= E_1) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_pc <= 0)) && (q_req_up == 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && !((m_pc == 1))) && (2 <= q_write_ev)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_req_up == 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (M_E == 2))) || (((((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (p_num_write == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || (((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || (((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && !((q_write_ev == 0))) && (T1_E == 2)) && (m_st == 0)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) RESULT: Ultimate proved your program to be correct! [2023-11-29 03:52:12,677 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c276393-1597-4c47-ab71-f4089c1f60e3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE