/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 14:46:57,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 14:46:57,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 14:46:57,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 14:46:57,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 14:46:57,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 14:46:57,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 14:46:57,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 14:46:57,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 14:46:57,671 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 14:46:57,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 14:46:57,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 14:46:57,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 14:46:57,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 14:46:57,673 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 14:46:57,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 14:46:57,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 14:46:57,674 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 14:46:57,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 14:46:57,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 14:46:57,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 14:46:57,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 14:46:57,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 14:46:57,675 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 14:46:57,675 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 14:46:57,676 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 14:46:57,676 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 14:46:57,676 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 14:46:57,676 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 14:46:57,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 14:46:57,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 14:46:57,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 14:46:57,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 14:46:57,677 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 14:46:57,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 14:46:57,678 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 14:46:57,678 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 14:46:57,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 14:46:57,678 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 14:46:57,678 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 14:46:57,678 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 14:46:57,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 14:46:57,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 14:46:57,680 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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: Use bitabs translation -> false [2023-12-20 14:46:57,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 14:46:57,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 14:46:57,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 14:46:57,890 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 14:46:57,890 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 14:46:57,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2023-12-20 14:46:58,875 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 14:46:59,080 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 14:46:59,080 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2023-12-20 14:46:59,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83936533f/83682edea2ff44ea822e8c2c184da31f/FLAGa774a3838 [2023-12-20 14:46:59,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83936533f/83682edea2ff44ea822e8c2c184da31f [2023-12-20 14:46:59,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 14:46:59,110 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 14:46:59,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 14:46:59,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 14:46:59,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 14:46:59,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 02:46:59" (1/1) ... [2023-12-20 14:46:59,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@676754fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:46:59, skipping insertion in model container [2023-12-20 14:46:59,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 02:46:59" (1/1) ... [2023-12-20 14:46:59,156 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 14:46:59,253 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[914,927] [2023-12-20 14:46:59,281 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[7115,7128] [2023-12-20 14:46:59,303 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 14:46:59,311 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 14:46:59,318 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[914,927] [2023-12-20 14:46:59,331 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[7115,7128] [2023-12-20 14:46:59,346 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 14:46:59,359 INFO L206 MainTranslator]: Completed translation [2023-12-20 14:46:59,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:46:59 WrapperNode [2023-12-20 14:46:59,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 14:46:59,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 14:46:59,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 14:46:59,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 14:46:59,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:46:59" (1/1) ... [2023-12-20 14:46:59,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:46:59" (1/1) ... [2023-12-20 14:46:59,406 INFO L138 Inliner]: procedures = 57, calls = 63, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 468 [2023-12-20 14:46:59,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 14:46:59,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 14:46:59,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 14:46:59,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 14:46:59,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:46:59" (1/1) ... [2023-12-20 14:46:59,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:46:59" (1/1) ... [2023-12-20 14:46:59,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:46:59" (1/1) ... [2023-12-20 14:46:59,435 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-12-20 14:46:59,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:46:59" (1/1) ... [2023-12-20 14:46:59,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:46:59" (1/1) ... [2023-12-20 14:46:59,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:46:59" (1/1) ... [2023-12-20 14:46:59,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:46:59" (1/1) ... [2023-12-20 14:46:59,447 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:46:59" (1/1) ... [2023-12-20 14:46:59,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:46:59" (1/1) ... [2023-12-20 14:46:59,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 14:46:59,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 14:46:59,453 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 14:46:59,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 14:46:59,453 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:46:59" (1/1) ... [2023-12-20 14:46:59,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 14:46:59,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:46:59,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-20 14:46:59,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-20 14:46:59,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 14:46:59,521 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-20 14:46:59,521 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-20 14:46:59,523 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-12-20 14:46:59,523 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-12-20 14:46:59,523 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-20 14:46:59,523 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-20 14:46:59,523 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-20 14:46:59,523 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-20 14:46:59,523 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-12-20 14:46:59,524 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-12-20 14:46:59,524 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-20 14:46:59,524 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-20 14:46:59,524 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-20 14:46:59,524 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-20 14:46:59,524 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-12-20 14:46:59,524 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-12-20 14:46:59,524 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-12-20 14:46:59,524 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-12-20 14:46:59,524 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-12-20 14:46:59,524 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-12-20 14:46:59,525 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-20 14:46:59,525 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-20 14:46:59,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 14:46:59,526 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-20 14:46:59,526 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-20 14:46:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-12-20 14:46:59,527 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-12-20 14:46:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 14:46:59,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 14:46:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-20 14:46:59,527 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-20 14:46:59,597 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 14:46:59,599 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 14:47:00,053 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 14:47:00,086 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 14:47:00,086 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-12-20 14:47:00,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 02:47:00 BoogieIcfgContainer [2023-12-20 14:47:00,086 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 14:47:00,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 14:47:00,088 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 14:47:00,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 14:47:00,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 02:46:59" (1/3) ... [2023-12-20 14:47:00,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5254cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 02:47:00, skipping insertion in model container [2023-12-20 14:47:00,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:46:59" (2/3) ... [2023-12-20 14:47:00,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5254cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 02:47:00, skipping insertion in model container [2023-12-20 14:47:00,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 02:47:00" (3/3) ... [2023-12-20 14:47:00,092 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2023-12-20 14:47:00,107 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 14:47:00,108 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-20 14:47:00,143 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 14:47:00,147 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;@2e0449a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 14:47:00,148 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-20 14:47:00,153 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 162 states have (on average 1.6358024691358024) internal successors, (265), 168 states have internal predecessors, (265), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-20 14:47:00,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-20 14:47:00,161 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:00,161 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-12-20 14:47:00,162 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:00,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:00,165 INFO L85 PathProgramCache]: Analyzing trace with hash -998187491, now seen corresponding path program 1 times [2023-12-20 14:47:00,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:00,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789087652] [2023-12-20 14:47:00,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:00,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:00,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:00,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:00,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 14:47:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:00,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:47:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:00,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:47:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:00,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 14:47:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:00,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 14:47:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:00,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:47:00,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:00,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789087652] [2023-12-20 14:47:00,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789087652] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:00,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:47:00,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 14:47:00,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482819320] [2023-12-20 14:47:00,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:00,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 14:47:00,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:00,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 14:47:00,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-20 14:47:00,501 INFO L87 Difference]: Start difference. First operand has 209 states, 162 states have (on average 1.6358024691358024) internal successors, (265), 168 states have internal predecessors, (265), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-20 14:47:00,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:00,992 INFO L93 Difference]: Finished difference Result 422 states and 654 transitions. [2023-12-20 14:47:00,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-20 14:47:00,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2023-12-20 14:47:00,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:01,008 INFO L225 Difference]: With dead ends: 422 [2023-12-20 14:47:01,008 INFO L226 Difference]: Without dead ends: 221 [2023-12-20 14:47:01,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-20 14:47:01,018 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 439 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:01,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 478 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 14:47:01,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-12-20 14:47:01,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 204. [2023-12-20 14:47:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 159 states have (on average 1.5031446540880504) internal successors, (239), 163 states have internal predecessors, (239), 30 states have call successors, (30), 14 states have call predecessors, (30), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-20 14:47:01,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 297 transitions. [2023-12-20 14:47:01,076 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 297 transitions. Word has length 58 [2023-12-20 14:47:01,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:01,076 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 297 transitions. [2023-12-20 14:47:01,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-20 14:47:01,077 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 297 transitions. [2023-12-20 14:47:01,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-20 14:47:01,083 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:01,083 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-12-20 14:47:01,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 14:47:01,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:01,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:01,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1030398619, now seen corresponding path program 1 times [2023-12-20 14:47:01,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:01,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35204898] [2023-12-20 14:47:01,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:01,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:01,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:01,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:01,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 14:47:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:01,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:47:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:01,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:47:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:01,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 14:47:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:01,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 14:47:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:47:01,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:01,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35204898] [2023-12-20 14:47:01,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35204898] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:01,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:47:01,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 14:47:01,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769440305] [2023-12-20 14:47:01,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:01,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 14:47:01,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:01,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 14:47:01,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-20 14:47:01,304 INFO L87 Difference]: Start difference. First operand 204 states and 297 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-12-20 14:47:01,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:01,950 INFO L93 Difference]: Finished difference Result 410 states and 594 transitions. [2023-12-20 14:47:01,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-20 14:47:01,953 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-12-20 14:47:01,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:01,959 INFO L225 Difference]: With dead ends: 410 [2023-12-20 14:47:01,959 INFO L226 Difference]: Without dead ends: 329 [2023-12-20 14:47:01,960 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-12-20 14:47:01,961 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 437 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:01,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 755 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 14:47:01,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2023-12-20 14:47:01,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 292. [2023-12-20 14:47:01,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 227 states have (on average 1.475770925110132) internal successors, (335), 233 states have internal predecessors, (335), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2023-12-20 14:47:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 420 transitions. [2023-12-20 14:47:01,984 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 420 transitions. Word has length 58 [2023-12-20 14:47:01,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:01,984 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 420 transitions. [2023-12-20 14:47:01,984 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-12-20 14:47:01,984 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 420 transitions. [2023-12-20 14:47:01,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-20 14:47:01,985 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:01,985 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-12-20 14:47:01,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 14:47:01,986 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:01,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:01,986 INFO L85 PathProgramCache]: Analyzing trace with hash -60763428, now seen corresponding path program 1 times [2023-12-20 14:47:01,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:01,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140617720] [2023-12-20 14:47:01,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:01,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:02,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:02,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:02,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 14:47:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:02,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:47:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:02,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:47:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:02,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 14:47:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:02,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 14:47:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:47:02,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:02,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140617720] [2023-12-20 14:47:02,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140617720] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:02,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:47:02,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-20 14:47:02,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259358254] [2023-12-20 14:47:02,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:02,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-20 14:47:02,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:02,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-20 14:47:02,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-20 14:47:02,113 INFO L87 Difference]: Start difference. First operand 292 states and 420 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-12-20 14:47:02,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:02,552 INFO L93 Difference]: Finished difference Result 488 states and 696 transitions. [2023-12-20 14:47:02,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-20 14:47:02,552 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-12-20 14:47:02,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:02,555 INFO L225 Difference]: With dead ends: 488 [2023-12-20 14:47:02,556 INFO L226 Difference]: Without dead ends: 326 [2023-12-20 14:47:02,557 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-12-20 14:47:02,559 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 350 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:02,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 952 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 14:47:02,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2023-12-20 14:47:02,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 296. [2023-12-20 14:47:02,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 230 states have (on average 1.4652173913043478) internal successors, (337), 236 states have internal predecessors, (337), 41 states have call successors, (41), 21 states have call predecessors, (41), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2023-12-20 14:47:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 423 transitions. [2023-12-20 14:47:02,597 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 423 transitions. Word has length 58 [2023-12-20 14:47:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:02,598 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 423 transitions. [2023-12-20 14:47:02,598 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-12-20 14:47:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 423 transitions. [2023-12-20 14:47:02,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-20 14:47:02,599 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:02,599 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-12-20 14:47:02,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 14:47:02,600 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:02,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:02,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1990220570, now seen corresponding path program 1 times [2023-12-20 14:47:02,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:02,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561713016] [2023-12-20 14:47:02,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:02,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:02,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:02,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:02,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 14:47:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:02,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:47:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:02,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:47:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:02,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 14:47:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:02,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 14:47:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:02,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:47:02,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:02,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561713016] [2023-12-20 14:47:02,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561713016] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:02,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:47:02,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-20 14:47:02,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334718053] [2023-12-20 14:47:02,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:02,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-20 14:47:02,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:02,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-20 14:47:02,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-20 14:47:02,762 INFO L87 Difference]: Start difference. First operand 296 states and 423 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-12-20 14:47:03,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:03,823 INFO L93 Difference]: Finished difference Result 1129 states and 1574 transitions. [2023-12-20 14:47:03,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-20 14:47:03,824 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-12-20 14:47:03,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:03,829 INFO L225 Difference]: With dead ends: 1129 [2023-12-20 14:47:03,829 INFO L226 Difference]: Without dead ends: 951 [2023-12-20 14:47:03,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2023-12-20 14:47:03,835 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 1771 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1789 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:03,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1789 Valid, 1279 Invalid, 1883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 1439 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-20 14:47:03,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2023-12-20 14:47:03,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 834. [2023-12-20 14:47:03,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 649 states have (on average 1.4006163328197228) internal successors, (909), 663 states have internal predecessors, (909), 98 states have call successors, (98), 74 states have call predecessors, (98), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2023-12-20 14:47:03,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1121 transitions. [2023-12-20 14:47:03,890 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1121 transitions. Word has length 58 [2023-12-20 14:47:03,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:03,892 INFO L495 AbstractCegarLoop]: Abstraction has 834 states and 1121 transitions. [2023-12-20 14:47:03,892 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-12-20 14:47:03,893 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1121 transitions. [2023-12-20 14:47:03,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-20 14:47:03,894 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:03,894 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-12-20 14:47:03,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 14:47:03,894 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:03,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:03,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1408145877, now seen corresponding path program 1 times [2023-12-20 14:47:03,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:03,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596336437] [2023-12-20 14:47:03,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:03,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:03,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:03,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:03,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 14:47:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:03,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:47:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:03,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:47:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:04,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 14:47:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:04,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 14:47:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:47:04,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:04,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596336437] [2023-12-20 14:47:04,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596336437] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:04,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:47:04,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-20 14:47:04,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167645053] [2023-12-20 14:47:04,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:04,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-20 14:47:04,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:04,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-20 14:47:04,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-20 14:47:04,026 INFO L87 Difference]: Start difference. First operand 834 states and 1121 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-12-20 14:47:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:04,495 INFO L93 Difference]: Finished difference Result 1648 states and 2197 transitions. [2023-12-20 14:47:04,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-20 14:47:04,495 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-12-20 14:47:04,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:04,499 INFO L225 Difference]: With dead ends: 1648 [2023-12-20 14:47:04,500 INFO L226 Difference]: Without dead ends: 938 [2023-12-20 14:47:04,501 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-12-20 14:47:04,502 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 353 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:04,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 948 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 14:47:04,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2023-12-20 14:47:04,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 850. [2023-12-20 14:47:04,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 661 states have (on average 1.3857791225416036) internal successors, (916), 675 states have internal predecessors, (916), 98 states have call successors, (98), 74 states have call predecessors, (98), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2023-12-20 14:47:04,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1132 transitions. [2023-12-20 14:47:04,580 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1132 transitions. Word has length 59 [2023-12-20 14:47:04,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:04,580 INFO L495 AbstractCegarLoop]: Abstraction has 850 states and 1132 transitions. [2023-12-20 14:47:04,581 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-12-20 14:47:04,581 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1132 transitions. [2023-12-20 14:47:04,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-20 14:47:04,582 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:04,582 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-12-20 14:47:04,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 14:47:04,582 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:04,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:04,583 INFO L85 PathProgramCache]: Analyzing trace with hash 515082157, now seen corresponding path program 1 times [2023-12-20 14:47:04,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:04,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505782064] [2023-12-20 14:47:04,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:04,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:04,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:04,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:04,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 14:47:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:04,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:47:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:04,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:47:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:04,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 14:47:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:04,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 14:47:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:04,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:47:04,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:04,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505782064] [2023-12-20 14:47:04,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505782064] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:04,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:47:04,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 14:47:04,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665931768] [2023-12-20 14:47:04,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:04,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 14:47:04,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:04,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 14:47:04,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:47:04,680 INFO L87 Difference]: Start difference. First operand 850 states and 1132 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-12-20 14:47:05,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:05,099 INFO L93 Difference]: Finished difference Result 2371 states and 3104 transitions. [2023-12-20 14:47:05,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-20 14:47:05,100 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-12-20 14:47:05,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:05,106 INFO L225 Difference]: With dead ends: 2371 [2023-12-20 14:47:05,107 INFO L226 Difference]: Without dead ends: 1646 [2023-12-20 14:47:05,108 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-12-20 14:47:05,109 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 871 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:05,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 425 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 14:47:05,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2023-12-20 14:47:05,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1514. [2023-12-20 14:47:05,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1158 states have (on average 1.3316062176165804) internal successors, (1542), 1184 states have internal predecessors, (1542), 178 states have call successors, (178), 141 states have call predecessors, (178), 176 states have return successors, (246), 190 states have call predecessors, (246), 176 states have call successors, (246) [2023-12-20 14:47:05,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1966 transitions. [2023-12-20 14:47:05,175 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1966 transitions. Word has length 59 [2023-12-20 14:47:05,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:05,175 INFO L495 AbstractCegarLoop]: Abstraction has 1514 states and 1966 transitions. [2023-12-20 14:47:05,175 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-12-20 14:47:05,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1966 transitions. [2023-12-20 14:47:05,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-20 14:47:05,176 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:05,176 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-12-20 14:47:05,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 14:47:05,176 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:05,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:05,177 INFO L85 PathProgramCache]: Analyzing trace with hash -529059355, now seen corresponding path program 1 times [2023-12-20 14:47:05,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:05,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192491540] [2023-12-20 14:47:05,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:05,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:05,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:05,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:05,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 14:47:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:05,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:47:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:05,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:47:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:05,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 14:47:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:05,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 14:47:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:05,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:47:05,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:05,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192491540] [2023-12-20 14:47:05,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192491540] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:05,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:47:05,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 14:47:05,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223223066] [2023-12-20 14:47:05,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:05,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 14:47:05,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:05,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 14:47:05,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-20 14:47:05,261 INFO L87 Difference]: Start difference. First operand 1514 states and 1966 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-12-20 14:47:05,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:05,667 INFO L93 Difference]: Finished difference Result 3681 states and 4738 transitions. [2023-12-20 14:47:05,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 14:47:05,668 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-12-20 14:47:05,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:05,675 INFO L225 Difference]: With dead ends: 3681 [2023-12-20 14:47:05,675 INFO L226 Difference]: Without dead ends: 2292 [2023-12-20 14:47:05,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-20 14:47:05,678 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 403 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:05,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 622 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 14:47:05,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2292 states. [2023-12-20 14:47:05,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2292 to 2048. [2023-12-20 14:47:05,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 1561 states have (on average 1.3164638052530429) internal successors, (2055), 1592 states have internal predecessors, (2055), 242 states have call successors, (242), 196 states have call predecessors, (242), 243 states have return successors, (329), 261 states have call predecessors, (329), 240 states have call successors, (329) [2023-12-20 14:47:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2626 transitions. [2023-12-20 14:47:05,779 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2626 transitions. Word has length 60 [2023-12-20 14:47:05,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:05,780 INFO L495 AbstractCegarLoop]: Abstraction has 2048 states and 2626 transitions. [2023-12-20 14:47:05,780 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-12-20 14:47:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2626 transitions. [2023-12-20 14:47:05,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-20 14:47:05,781 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:05,781 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] [2023-12-20 14:47:05,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 14:47:05,781 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:05,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:05,782 INFO L85 PathProgramCache]: Analyzing trace with hash -2816761, now seen corresponding path program 1 times [2023-12-20 14:47:05,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:05,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031201835] [2023-12-20 14:47:05,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:05,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:05,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:05,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:05,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:47:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:05,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:47:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:05,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:47:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:05,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:47:05,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:05,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031201835] [2023-12-20 14:47:05,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031201835] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:05,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:47:05,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 14:47:05,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220885465] [2023-12-20 14:47:05,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:05,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 14:47:05,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:05,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 14:47:05,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 14:47:05,835 INFO L87 Difference]: Start difference. First operand 2048 states and 2626 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:47:06,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:06,233 INFO L93 Difference]: Finished difference Result 2190 states and 2847 transitions. [2023-12-20 14:47:06,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 14:47:06,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-20 14:47:06,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:06,240 INFO L225 Difference]: With dead ends: 2190 [2023-12-20 14:47:06,240 INFO L226 Difference]: Without dead ends: 2078 [2023-12-20 14:47:06,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-20 14:47:06,241 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 361 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:06,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 426 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 14:47:06,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2023-12-20 14:47:06,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 2048. [2023-12-20 14:47:06,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 1561 states have (on average 1.315823190262652) internal successors, (2054), 1592 states have internal predecessors, (2054), 242 states have call successors, (242), 196 states have call predecessors, (242), 243 states have return successors, (329), 261 states have call predecessors, (329), 240 states have call successors, (329) [2023-12-20 14:47:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2625 transitions. [2023-12-20 14:47:06,359 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2625 transitions. Word has length 61 [2023-12-20 14:47:06,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:06,359 INFO L495 AbstractCegarLoop]: Abstraction has 2048 states and 2625 transitions. [2023-12-20 14:47:06,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:47:06,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2625 transitions. [2023-12-20 14:47:06,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-20 14:47:06,360 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:06,360 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] [2023-12-20 14:47:06,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 14:47:06,361 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:06,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:06,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1389602171, now seen corresponding path program 1 times [2023-12-20 14:47:06,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:06,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082352324] [2023-12-20 14:47:06,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:06,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:06,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:06,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:06,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:47:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:06,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:47:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:06,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:47:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:06,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:47:06,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:06,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082352324] [2023-12-20 14:47:06,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082352324] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:06,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:47:06,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 14:47:06,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239828770] [2023-12-20 14:47:06,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:06,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 14:47:06,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:06,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 14:47:06,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 14:47:06,423 INFO L87 Difference]: Start difference. First operand 2048 states and 2625 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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-12-20 14:47:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:07,074 INFO L93 Difference]: Finished difference Result 2323 states and 3051 transitions. [2023-12-20 14:47:07,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 14:47:07,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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 61 [2023-12-20 14:47:07,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:07,082 INFO L225 Difference]: With dead ends: 2323 [2023-12-20 14:47:07,082 INFO L226 Difference]: Without dead ends: 2215 [2023-12-20 14:47:07,083 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-12-20 14:47:07,084 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 589 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:07,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 543 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 14:47:07,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2023-12-20 14:47:07,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 2156. [2023-12-20 14:47:07,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 1651 states have (on average 1.327680193821926) internal successors, (2192), 1683 states have internal predecessors, (2192), 253 states have call successors, (253), 202 states have call predecessors, (253), 250 states have return successors, (343), 272 states have call predecessors, (343), 251 states have call successors, (343) [2023-12-20 14:47:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2788 transitions. [2023-12-20 14:47:07,210 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2788 transitions. Word has length 61 [2023-12-20 14:47:07,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:07,210 INFO L495 AbstractCegarLoop]: Abstraction has 2156 states and 2788 transitions. [2023-12-20 14:47:07,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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-12-20 14:47:07,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2788 transitions. [2023-12-20 14:47:07,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-20 14:47:07,211 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:07,211 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] [2023-12-20 14:47:07,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-20 14:47:07,211 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:07,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:07,212 INFO L85 PathProgramCache]: Analyzing trace with hash 618846533, now seen corresponding path program 1 times [2023-12-20 14:47:07,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:07,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643650002] [2023-12-20 14:47:07,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:07,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:07,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:07,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:07,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:47:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:07,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:47:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:07,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:47:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:47:07,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:07,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643650002] [2023-12-20 14:47:07,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643650002] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:07,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:47:07,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 14:47:07,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709585130] [2023-12-20 14:47:07,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:07,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 14:47:07,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:07,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 14:47:07,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:47:07,310 INFO L87 Difference]: Start difference. First operand 2156 states and 2788 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-12-20 14:47:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:08,122 INFO L93 Difference]: Finished difference Result 2568 states and 3417 transitions. [2023-12-20 14:47:08,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-20 14:47:08,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 61 [2023-12-20 14:47:08,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:08,130 INFO L225 Difference]: With dead ends: 2568 [2023-12-20 14:47:08,130 INFO L226 Difference]: Without dead ends: 2352 [2023-12-20 14:47:08,131 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-12-20 14:47:08,131 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 594 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:08,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 883 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-20 14:47:08,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2023-12-20 14:47:08,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 2257. [2023-12-20 14:47:08,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 1734 states have (on average 1.3356401384083045) internal successors, (2316), 1767 states have internal predecessors, (2316), 264 states have call successors, (264), 208 states have call predecessors, (264), 257 states have return successors, (356), 284 states have call predecessors, (356), 262 states have call successors, (356) [2023-12-20 14:47:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 2936 transitions. [2023-12-20 14:47:08,289 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 2936 transitions. Word has length 61 [2023-12-20 14:47:08,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:08,289 INFO L495 AbstractCegarLoop]: Abstraction has 2257 states and 2936 transitions. [2023-12-20 14:47:08,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-12-20 14:47:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 2936 transitions. [2023-12-20 14:47:08,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-20 14:47:08,290 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:08,290 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] [2023-12-20 14:47:08,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-20 14:47:08,291 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:08,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:08,291 INFO L85 PathProgramCache]: Analyzing trace with hash 603327815, now seen corresponding path program 1 times [2023-12-20 14:47:08,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:08,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62448795] [2023-12-20 14:47:08,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:08,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:08,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:08,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:08,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:47:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:08,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:47:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:08,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:47:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:08,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:47:08,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:08,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62448795] [2023-12-20 14:47:08,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62448795] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:08,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:47:08,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 14:47:08,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600818201] [2023-12-20 14:47:08,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:08,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 14:47:08,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:08,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 14:47:08,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:47:08,364 INFO L87 Difference]: Start difference. First operand 2257 states and 2936 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-12-20 14:47:09,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:09,303 INFO L93 Difference]: Finished difference Result 2989 states and 4049 transitions. [2023-12-20 14:47:09,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-20 14:47:09,304 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 61 [2023-12-20 14:47:09,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:09,311 INFO L225 Difference]: With dead ends: 2989 [2023-12-20 14:47:09,311 INFO L226 Difference]: Without dead ends: 2672 [2023-12-20 14:47:09,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-20 14:47:09,313 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 608 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:09,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 874 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-20 14:47:09,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2023-12-20 14:47:09,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 2459. [2023-12-20 14:47:09,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 1902 states have (on average 1.35068349106204) internal successors, (2569), 1937 states have internal predecessors, (2569), 284 states have call successors, (284), 220 states have call predecessors, (284), 271 states have return successors, (384), 306 states have call predecessors, (384), 282 states have call successors, (384) [2023-12-20 14:47:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 3237 transitions. [2023-12-20 14:47:09,475 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 3237 transitions. Word has length 61 [2023-12-20 14:47:09,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:09,476 INFO L495 AbstractCegarLoop]: Abstraction has 2459 states and 3237 transitions. [2023-12-20 14:47:09,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-12-20 14:47:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 3237 transitions. [2023-12-20 14:47:09,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-20 14:47:09,477 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:09,477 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] [2023-12-20 14:47:09,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-20 14:47:09,477 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:09,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:09,478 INFO L85 PathProgramCache]: Analyzing trace with hash 250239433, now seen corresponding path program 1 times [2023-12-20 14:47:09,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:09,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972072824] [2023-12-20 14:47:09,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:09,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:09,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:09,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:09,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:47:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:09,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:47:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:09,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:47:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:09,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:47:09,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:09,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972072824] [2023-12-20 14:47:09,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972072824] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:09,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:47:09,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 14:47:09,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791554487] [2023-12-20 14:47:09,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:09,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 14:47:09,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:09,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 14:47:09,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:47:09,556 INFO L87 Difference]: Start difference. First operand 2459 states and 3237 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-12-20 14:47:10,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:10,426 INFO L93 Difference]: Finished difference Result 3693 states and 5100 transitions. [2023-12-20 14:47:10,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-20 14:47:10,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 61 [2023-12-20 14:47:10,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:10,437 INFO L225 Difference]: With dead ends: 3693 [2023-12-20 14:47:10,437 INFO L226 Difference]: Without dead ends: 3174 [2023-12-20 14:47:10,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-20 14:47:10,439 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 635 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:10,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 870 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-20 14:47:10,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3174 states. [2023-12-20 14:47:10,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3174 to 2840. [2023-12-20 14:47:10,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2217 states have (on average 1.3716734325665314) internal successors, (3041), 2256 states have internal predecessors, (3041), 322 states have call successors, (322), 244 states have call predecessors, (322), 299 states have return successors, (444), 348 states have call predecessors, (444), 320 states have call successors, (444) [2023-12-20 14:47:10,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 3807 transitions. [2023-12-20 14:47:10,579 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 3807 transitions. Word has length 61 [2023-12-20 14:47:10,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:10,579 INFO L495 AbstractCegarLoop]: Abstraction has 2840 states and 3807 transitions. [2023-12-20 14:47:10,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-12-20 14:47:10,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 3807 transitions. [2023-12-20 14:47:10,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-20 14:47:10,580 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:10,580 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] [2023-12-20 14:47:10,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-20 14:47:10,581 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:10,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:10,581 INFO L85 PathProgramCache]: Analyzing trace with hash -2116455161, now seen corresponding path program 1 times [2023-12-20 14:47:10,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:10,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141271156] [2023-12-20 14:47:10,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:10,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:10,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:10,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:10,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:47:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:10,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:47:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:10,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:47:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:10,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:47:10,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:10,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141271156] [2023-12-20 14:47:10,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141271156] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:10,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:47:10,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 14:47:10,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613364547] [2023-12-20 14:47:10,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:10,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 14:47:10,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:10,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 14:47:10,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:47:10,643 INFO L87 Difference]: Start difference. First operand 2840 states and 3807 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-12-20 14:47:11,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:11,173 INFO L93 Difference]: Finished difference Result 3953 states and 5505 transitions. [2023-12-20 14:47:11,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 14:47:11,173 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 61 [2023-12-20 14:47:11,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:11,183 INFO L225 Difference]: With dead ends: 3953 [2023-12-20 14:47:11,183 INFO L226 Difference]: Without dead ends: 3053 [2023-12-20 14:47:11,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-20 14:47:11,186 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 589 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:11,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 456 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 14:47:11,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2023-12-20 14:47:11,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 2840. [2023-12-20 14:47:11,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2217 states have (on average 1.3676138926477222) internal successors, (3032), 2256 states have internal predecessors, (3032), 322 states have call successors, (322), 244 states have call predecessors, (322), 299 states have return successors, (444), 348 states have call predecessors, (444), 320 states have call successors, (444) [2023-12-20 14:47:11,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 3798 transitions. [2023-12-20 14:47:11,380 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 3798 transitions. Word has length 61 [2023-12-20 14:47:11,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:11,380 INFO L495 AbstractCegarLoop]: Abstraction has 2840 states and 3798 transitions. [2023-12-20 14:47:11,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-12-20 14:47:11,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 3798 transitions. [2023-12-20 14:47:11,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-20 14:47:11,383 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:11,383 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] [2023-12-20 14:47:11,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-20 14:47:11,383 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:11,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:11,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1222968823, now seen corresponding path program 1 times [2023-12-20 14:47:11,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:11,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947621308] [2023-12-20 14:47:11,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:11,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:11,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:11,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:11,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:47:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:11,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:47:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:11,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:47:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:47:11,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:11,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947621308] [2023-12-20 14:47:11,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947621308] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:11,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:47:11,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 14:47:11,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508669224] [2023-12-20 14:47:11,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:11,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 14:47:11,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:11,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 14:47:11,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:47:11,447 INFO L87 Difference]: Start difference. First operand 2840 states and 3798 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-12-20 14:47:12,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:12,291 INFO L93 Difference]: Finished difference Result 5117 states and 7254 transitions. [2023-12-20 14:47:12,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-20 14:47:12,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 61 [2023-12-20 14:47:12,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:12,313 INFO L225 Difference]: With dead ends: 5117 [2023-12-20 14:47:12,314 INFO L226 Difference]: Without dead ends: 4218 [2023-12-20 14:47:12,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2023-12-20 14:47:12,317 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 612 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:12,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 678 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 14:47:12,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4218 states. [2023-12-20 14:47:12,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4218 to 3735. [2023-12-20 14:47:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3735 states, 2958 states have (on average 1.3999323867478026) internal successors, (4141), 3019 states have internal predecessors, (4141), 414 states have call successors, (414), 298 states have call predecessors, (414), 361 states have return successors, (564), 426 states have call predecessors, (564), 412 states have call successors, (564) [2023-12-20 14:47:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3735 states to 3735 states and 5119 transitions. [2023-12-20 14:47:12,542 INFO L78 Accepts]: Start accepts. Automaton has 3735 states and 5119 transitions. Word has length 61 [2023-12-20 14:47:12,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:12,542 INFO L495 AbstractCegarLoop]: Abstraction has 3735 states and 5119 transitions. [2023-12-20 14:47:12,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-12-20 14:47:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3735 states and 5119 transitions. [2023-12-20 14:47:12,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-20 14:47:12,544 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:12,544 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] [2023-12-20 14:47:12,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-20 14:47:12,544 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:12,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:12,545 INFO L85 PathProgramCache]: Analyzing trace with hash 700259211, now seen corresponding path program 1 times [2023-12-20 14:47:12,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:12,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210319143] [2023-12-20 14:47:12,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:12,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:12,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:12,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:12,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:47:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:12,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:47:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:12,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:47:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:12,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:47:12,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:12,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210319143] [2023-12-20 14:47:12,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210319143] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:12,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:47:12,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 14:47:12,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623167881] [2023-12-20 14:47:12,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:12,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 14:47:12,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:12,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 14:47:12,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:47:12,643 INFO L87 Difference]: Start difference. First operand 3735 states and 5119 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-12-20 14:47:13,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:13,762 INFO L93 Difference]: Finished difference Result 7166 states and 10337 transitions. [2023-12-20 14:47:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-20 14:47:13,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 61 [2023-12-20 14:47:13,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:13,780 INFO L225 Difference]: With dead ends: 7166 [2023-12-20 14:47:13,780 INFO L226 Difference]: Without dead ends: 5372 [2023-12-20 14:47:13,786 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-12-20 14:47:13,786 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 1298 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:13,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1315 Valid, 728 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-20 14:47:13,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5372 states. [2023-12-20 14:47:14,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5372 to 4670. [2023-12-20 14:47:14,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4670 states, 3735 states have (on average 1.4008032128514056) internal successors, (5232), 3805 states have internal predecessors, (5232), 506 states have call successors, (506), 356 states have call predecessors, (506), 427 states have return successors, (743), 517 states have call predecessors, (743), 504 states have call successors, (743) [2023-12-20 14:47:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4670 states to 4670 states and 6481 transitions. [2023-12-20 14:47:14,038 INFO L78 Accepts]: Start accepts. Automaton has 4670 states and 6481 transitions. Word has length 61 [2023-12-20 14:47:14,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:14,039 INFO L495 AbstractCegarLoop]: Abstraction has 4670 states and 6481 transitions. [2023-12-20 14:47:14,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-12-20 14:47:14,040 INFO L276 IsEmpty]: Start isEmpty. Operand 4670 states and 6481 transitions. [2023-12-20 14:47:14,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-20 14:47:14,041 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:14,041 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-12-20 14:47:14,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-20 14:47:14,041 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:14,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:14,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1574279004, now seen corresponding path program 1 times [2023-12-20 14:47:14,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:14,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842319704] [2023-12-20 14:47:14,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:14,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:14,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:14,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:14,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 14:47:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:14,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:47:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:14,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:47:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:14,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 14:47:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:14,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 14:47:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:47:14,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:14,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842319704] [2023-12-20 14:47:14,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842319704] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:14,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:47:14,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 14:47:14,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301209298] [2023-12-20 14:47:14,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:14,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 14:47:14,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:14,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 14:47:14,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-20 14:47:14,092 INFO L87 Difference]: Start difference. First operand 4670 states and 6481 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-12-20 14:47:14,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:14,585 INFO L93 Difference]: Finished difference Result 7013 states and 9429 transitions. [2023-12-20 14:47:14,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 14:47:14,585 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-12-20 14:47:14,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:14,598 INFO L225 Difference]: With dead ends: 7013 [2023-12-20 14:47:14,598 INFO L226 Difference]: Without dead ends: 5089 [2023-12-20 14:47:14,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-20 14:47:14,601 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 530 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:14,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 573 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 14:47:14,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5089 states. [2023-12-20 14:47:14,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5089 to 4846. [2023-12-20 14:47:14,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4846 states, 3872 states have (on average 1.3948863636363635) internal successors, (5401), 3944 states have internal predecessors, (5401), 525 states have call successors, (525), 373 states have call predecessors, (525), 447 states have return successors, (765), 537 states have call predecessors, (765), 523 states have call successors, (765) [2023-12-20 14:47:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4846 states to 4846 states and 6691 transitions. [2023-12-20 14:47:14,882 INFO L78 Accepts]: Start accepts. Automaton has 4846 states and 6691 transitions. Word has length 66 [2023-12-20 14:47:14,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:14,884 INFO L495 AbstractCegarLoop]: Abstraction has 4846 states and 6691 transitions. [2023-12-20 14:47:14,884 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-12-20 14:47:14,884 INFO L276 IsEmpty]: Start isEmpty. Operand 4846 states and 6691 transitions. [2023-12-20 14:47:14,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-20 14:47:14,886 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:14,886 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-12-20 14:47:14,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-20 14:47:14,886 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:14,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:14,886 INFO L85 PathProgramCache]: Analyzing trace with hash -2074207797, now seen corresponding path program 1 times [2023-12-20 14:47:14,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:14,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335098697] [2023-12-20 14:47:14,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:14,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:14,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:14,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:14,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 14:47:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:14,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:47:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:14,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:47:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:14,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 14:47:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:14,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 14:47:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:14,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:47:14,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:14,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335098697] [2023-12-20 14:47:14,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335098697] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:14,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:47:14,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 14:47:14,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864387058] [2023-12-20 14:47:14,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:14,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 14:47:14,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:14,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 14:47:14,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:47:14,951 INFO L87 Difference]: Start difference. First operand 4846 states and 6691 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-12-20 14:47:15,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:15,638 INFO L93 Difference]: Finished difference Result 5690 states and 7719 transitions. [2023-12-20 14:47:15,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-20 14:47:15,639 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-12-20 14:47:15,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:15,650 INFO L225 Difference]: With dead ends: 5690 [2023-12-20 14:47:15,651 INFO L226 Difference]: Without dead ends: 5687 [2023-12-20 14:47:15,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2023-12-20 14:47:15,652 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 819 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:15,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 550 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 14:47:15,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5687 states. [2023-12-20 14:47:15,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5687 to 5124. [2023-12-20 14:47:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5124 states, 4079 states have (on average 1.3868595243932336) internal successors, (5657), 4154 states have internal predecessors, (5657), 557 states have call successors, (557), 401 states have call predecessors, (557), 486 states have return successors, (816), 577 states have call predecessors, (816), 556 states have call successors, (816) [2023-12-20 14:47:15,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 7030 transitions. [2023-12-20 14:47:15,913 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 7030 transitions. Word has length 67 [2023-12-20 14:47:15,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:15,913 INFO L495 AbstractCegarLoop]: Abstraction has 5124 states and 7030 transitions. [2023-12-20 14:47:15,913 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-12-20 14:47:15,913 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 7030 transitions. [2023-12-20 14:47:15,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-20 14:47:15,915 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:15,915 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-12-20 14:47:15,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-20 14:47:15,915 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:15,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:15,915 INFO L85 PathProgramCache]: Analyzing trace with hash 123364814, now seen corresponding path program 1 times [2023-12-20 14:47:15,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:15,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358981195] [2023-12-20 14:47:15,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:15,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:15,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:15,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:15,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 14:47:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:15,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:47:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:15,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:47:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:15,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 14:47:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:15,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 14:47:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:47:16,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:16,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358981195] [2023-12-20 14:47:16,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358981195] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:47:16,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132610586] [2023-12-20 14:47:16,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:16,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:47:16,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:47:16,014 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:47:16,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 14:47:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:16,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-20 14:47:16,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:47:16,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:47:16,297 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 14:47:16,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:47:16,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132610586] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 14:47:16,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 14:47:16,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2023-12-20 14:47:16,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202641475] [2023-12-20 14:47:16,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 14:47:16,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-20 14:47:16,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:16,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-20 14:47:16,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-20 14:47:16,358 INFO L87 Difference]: Start difference. First operand 5124 states and 7030 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-12-20 14:47:17,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:17,720 INFO L93 Difference]: Finished difference Result 8297 states and 10939 transitions. [2023-12-20 14:47:17,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-20 14:47:17,720 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-12-20 14:47:17,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:17,742 INFO L225 Difference]: With dead ends: 8297 [2023-12-20 14:47:17,742 INFO L226 Difference]: Without dead ends: 8294 [2023-12-20 14:47:17,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2023-12-20 14:47:17,746 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 999 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:17,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 1125 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-20 14:47:17,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8294 states. [2023-12-20 14:47:18,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8294 to 7452. [2023-12-20 14:47:18,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7452 states, 5845 states have (on average 1.3536355859709153) internal successors, (7912), 5947 states have internal predecessors, (7912), 828 states have call successors, (828), 636 states have call predecessors, (828), 777 states have return successors, (1188), 877 states have call predecessors, (1188), 827 states have call successors, (1188) [2023-12-20 14:47:18,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7452 states to 7452 states and 9928 transitions. [2023-12-20 14:47:18,324 INFO L78 Accepts]: Start accepts. Automaton has 7452 states and 9928 transitions. Word has length 68 [2023-12-20 14:47:18,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:18,324 INFO L495 AbstractCegarLoop]: Abstraction has 7452 states and 9928 transitions. [2023-12-20 14:47:18,324 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-12-20 14:47:18,324 INFO L276 IsEmpty]: Start isEmpty. Operand 7452 states and 9928 transitions. [2023-12-20 14:47:18,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-20 14:47:18,326 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:18,326 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-12-20 14:47:18,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-20 14:47:18,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-20 14:47:18,532 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:18,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:18,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2067840267, now seen corresponding path program 2 times [2023-12-20 14:47:18,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:18,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788226135] [2023-12-20 14:47:18,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:18,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:18,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:18,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:18,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 14:47:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:18,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:47:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:18,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:47:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:18,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 14:47:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:18,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 14:47:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:47:18,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:18,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788226135] [2023-12-20 14:47:18,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788226135] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:18,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:47:18,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 14:47:18,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917113557] [2023-12-20 14:47:18,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:18,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 14:47:18,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:18,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 14:47:18,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-20 14:47:18,570 INFO L87 Difference]: Start difference. First operand 7452 states and 9928 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-12-20 14:47:19,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:19,177 INFO L93 Difference]: Finished difference Result 9627 states and 12648 transitions. [2023-12-20 14:47:19,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-20 14:47:19,178 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-12-20 14:47:19,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:19,189 INFO L225 Difference]: With dead ends: 9627 [2023-12-20 14:47:19,189 INFO L226 Difference]: Without dead ends: 5386 [2023-12-20 14:47:19,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-20 14:47:19,196 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 485 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:19,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 608 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 14:47:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5386 states. [2023-12-20 14:47:19,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5386 to 4754. [2023-12-20 14:47:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4754 states, 3813 states have (on average 1.3815892997639654) internal successors, (5268), 3877 states have internal predecessors, (5268), 513 states have call successors, (513), 367 states have call predecessors, (513), 426 states have return successors, (731), 518 states have call predecessors, (731), 512 states have call successors, (731) [2023-12-20 14:47:19,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4754 states to 4754 states and 6512 transitions. [2023-12-20 14:47:19,516 INFO L78 Accepts]: Start accepts. Automaton has 4754 states and 6512 transitions. Word has length 71 [2023-12-20 14:47:19,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:19,517 INFO L495 AbstractCegarLoop]: Abstraction has 4754 states and 6512 transitions. [2023-12-20 14:47:19,517 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-12-20 14:47:19,517 INFO L276 IsEmpty]: Start isEmpty. Operand 4754 states and 6512 transitions. [2023-12-20 14:47:19,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-20 14:47:19,520 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:19,520 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-12-20 14:47:19,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-20 14:47:19,520 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:19,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:19,521 INFO L85 PathProgramCache]: Analyzing trace with hash -963374144, now seen corresponding path program 1 times [2023-12-20 14:47:19,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:19,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198392999] [2023-12-20 14:47:19,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:19,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:19,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:19,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:19,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 14:47:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:19,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:47:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:19,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:47:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:19,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 14:47:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:19,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 14:47:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:19,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 14:47:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:19,594 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-20 14:47:19,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:19,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198392999] [2023-12-20 14:47:19,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198392999] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:19,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:47:19,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 14:47:19,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988392770] [2023-12-20 14:47:19,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:19,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 14:47:19,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:19,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 14:47:19,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-20 14:47:19,596 INFO L87 Difference]: Start difference. First operand 4754 states and 6512 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-12-20 14:47:20,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:20,594 INFO L93 Difference]: Finished difference Result 8866 states and 11578 transitions. [2023-12-20 14:47:20,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-20 14:47:20,594 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-12-20 14:47:20,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:20,608 INFO L225 Difference]: With dead ends: 8866 [2023-12-20 14:47:20,608 INFO L226 Difference]: Without dead ends: 6280 [2023-12-20 14:47:20,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2023-12-20 14:47:20,613 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 847 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:20,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 835 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 14:47:20,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6280 states. [2023-12-20 14:47:20,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6280 to 6035. [2023-12-20 14:47:20,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6035 states, 4766 states have (on average 1.344313890054553) internal successors, (6407), 4860 states have internal predecessors, (6407), 663 states have call successors, (663), 495 states have call predecessors, (663), 604 states have return successors, (992), 688 states have call predecessors, (992), 662 states have call successors, (992) [2023-12-20 14:47:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6035 states to 6035 states and 8062 transitions. [2023-12-20 14:47:20,999 INFO L78 Accepts]: Start accepts. Automaton has 6035 states and 8062 transitions. Word has length 76 [2023-12-20 14:47:20,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:20,999 INFO L495 AbstractCegarLoop]: Abstraction has 6035 states and 8062 transitions. [2023-12-20 14:47:20,999 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-12-20 14:47:20,999 INFO L276 IsEmpty]: Start isEmpty. Operand 6035 states and 8062 transitions. [2023-12-20 14:47:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-20 14:47:21,002 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:21,003 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-12-20 14:47:21,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-20 14:47:21,003 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:21,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:21,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1927183056, now seen corresponding path program 1 times [2023-12-20 14:47:21,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:21,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784842952] [2023-12-20 14:47:21,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:21,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:21,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:21,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:21,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 14:47:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:21,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:47:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:21,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:47:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:21,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 14:47:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:21,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 14:47:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:21,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-20 14:47:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:21,122 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-20 14:47:21,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:21,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784842952] [2023-12-20 14:47:21,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784842952] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:21,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:47:21,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-20 14:47:21,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299730685] [2023-12-20 14:47:21,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:21,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-20 14:47:21,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:21,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-20 14:47:21,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-20 14:47:21,125 INFO L87 Difference]: Start difference. First operand 6035 states and 8062 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-12-20 14:47:22,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:22,129 INFO L93 Difference]: Finished difference Result 8473 states and 11056 transitions. [2023-12-20 14:47:22,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-20 14:47:22,129 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-12-20 14:47:22,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:22,142 INFO L225 Difference]: With dead ends: 8473 [2023-12-20 14:47:22,142 INFO L226 Difference]: Without dead ends: 5546 [2023-12-20 14:47:22,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2023-12-20 14:47:22,148 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 1299 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1330 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:22,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1330 Valid, 838 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 14:47:22,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5546 states. [2023-12-20 14:47:22,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5546 to 5180. [2023-12-20 14:47:22,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5180 states, 4108 states have (on average 1.3522395326192795) internal successors, (5555), 4191 states have internal predecessors, (5555), 563 states have call successors, (563), 408 states have call predecessors, (563), 507 states have return successors, (828), 589 states have call predecessors, (828), 562 states have call successors, (828) [2023-12-20 14:47:22,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5180 states to 5180 states and 6946 transitions. [2023-12-20 14:47:22,520 INFO L78 Accepts]: Start accepts. Automaton has 5180 states and 6946 transitions. Word has length 86 [2023-12-20 14:47:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:22,521 INFO L495 AbstractCegarLoop]: Abstraction has 5180 states and 6946 transitions. [2023-12-20 14:47:22,521 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-12-20 14:47:22,521 INFO L276 IsEmpty]: Start isEmpty. Operand 5180 states and 6946 transitions. [2023-12-20 14:47:22,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-20 14:47:22,525 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:22,526 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, 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-12-20 14:47:22,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-20 14:47:22,526 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:22,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:22,526 INFO L85 PathProgramCache]: Analyzing trace with hash 952142814, now seen corresponding path program 1 times [2023-12-20 14:47:22,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:22,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140213090] [2023-12-20 14:47:22,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:22,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:22,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:22,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:22,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:47:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:22,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:47:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:22,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:47:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:22,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 14:47:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:22,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:22,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 14:47:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-20 14:47:22,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:22,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140213090] [2023-12-20 14:47:22,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140213090] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:47:22,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933466541] [2023-12-20 14:47:22,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:22,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:47:22,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:47:22,610 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:47:22,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-20 14:47:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:22,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 14:47:22,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:47:22,712 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-20 14:47:22,712 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:47:22,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933466541] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:22,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:47:22,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:47:22,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409814456] [2023-12-20 14:47:22,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:22,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:47:22,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:22,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:47:22,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:47:22,713 INFO L87 Difference]: Start difference. First operand 5180 states and 6946 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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-12-20 14:47:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:23,062 INFO L93 Difference]: Finished difference Result 8096 states and 11428 transitions. [2023-12-20 14:47:23,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:47:23,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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 99 [2023-12-20 14:47:23,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:23,082 INFO L225 Difference]: With dead ends: 8096 [2023-12-20 14:47:23,083 INFO L226 Difference]: Without dead ends: 6586 [2023-12-20 14:47:23,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 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-12-20 14:47:23,090 INFO L413 NwaCegarLoop]: 399 mSDtfsCounter, 133 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:23,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 665 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:47:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6586 states. [2023-12-20 14:47:23,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6586 to 6581. [2023-12-20 14:47:23,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6581 states, 5267 states have (on average 1.3740269603189672) internal successors, (7237), 5362 states have internal predecessors, (7237), 703 states have call successors, (703), 496 states have call predecessors, (703), 609 states have return successors, (1148), 731 states have call predecessors, (1148), 702 states have call successors, (1148) [2023-12-20 14:47:23,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6581 states to 6581 states and 9088 transitions. [2023-12-20 14:47:23,519 INFO L78 Accepts]: Start accepts. Automaton has 6581 states and 9088 transitions. Word has length 99 [2023-12-20 14:47:23,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:23,519 INFO L495 AbstractCegarLoop]: Abstraction has 6581 states and 9088 transitions. [2023-12-20 14:47:23,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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-12-20 14:47:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 6581 states and 9088 transitions. [2023-12-20 14:47:23,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-20 14:47:23,528 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:23,529 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-12-20 14:47:23,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-20 14:47:23,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-20 14:47:23,734 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:23,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:23,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1291156472, now seen corresponding path program 1 times [2023-12-20 14:47:23,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:23,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620681428] [2023-12-20 14:47:23,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:23,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:23,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:23,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:23,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 14:47:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:23,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:47:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:23,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:47:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:23,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 14:47:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:23,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 14:47:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:23,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 14:47:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:23,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 14:47:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:23,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 14:47:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:23,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-20 14:47:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:23,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:47:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:23,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:47:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:23,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 14:47:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:23,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 14:47:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:23,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 14:47:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:23,851 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-12-20 14:47:23,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:23,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620681428] [2023-12-20 14:47:23,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620681428] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:47:23,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063931322] [2023-12-20 14:47:23,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:23,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:47:23,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:47:23,852 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:47:23,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-20 14:47:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:23,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-20 14:47:23,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:47:23,988 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-20 14:47:23,988 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:47:23,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063931322] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:23,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:47:23,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2023-12-20 14:47:23,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852235694] [2023-12-20 14:47:23,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:23,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 14:47:23,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:23,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 14:47:23,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-12-20 14:47:23,991 INFO L87 Difference]: Start difference. First operand 6581 states and 9088 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-12-20 14:47:24,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:24,363 INFO L93 Difference]: Finished difference Result 7929 states and 10742 transitions. [2023-12-20 14:47:24,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 14:47:24,364 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-12-20 14:47:24,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:24,381 INFO L225 Difference]: With dead ends: 7929 [2023-12-20 14:47:24,381 INFO L226 Difference]: Without dead ends: 5496 [2023-12-20 14:47:24,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-20 14:47:24,388 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 32 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:24,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1319 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:47:24,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5496 states. [2023-12-20 14:47:24,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5496 to 5398. [2023-12-20 14:47:24,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5398 states, 4423 states have (on average 1.4031200542618132) internal successors, (6206), 4487 states have internal predecessors, (6206), 545 states have call successors, (545), 355 states have call predecessors, (545), 428 states have return successors, (927), 563 states have call predecessors, (927), 544 states have call successors, (927) [2023-12-20 14:47:24,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5398 states to 5398 states and 7678 transitions. [2023-12-20 14:47:24,670 INFO L78 Accepts]: Start accepts. Automaton has 5398 states and 7678 transitions. Word has length 131 [2023-12-20 14:47:24,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:24,670 INFO L495 AbstractCegarLoop]: Abstraction has 5398 states and 7678 transitions. [2023-12-20 14:47:24,670 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-12-20 14:47:24,670 INFO L276 IsEmpty]: Start isEmpty. Operand 5398 states and 7678 transitions. [2023-12-20 14:47:24,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-20 14:47:24,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:24,678 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-20 14:47:24,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-20 14:47:24,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:47:24,884 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:24,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:24,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1855357641, now seen corresponding path program 1 times [2023-12-20 14:47:24,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:24,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498604987] [2023-12-20 14:47:24,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:24,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:24,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:24,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:24,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:47:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:24,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:47:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:24,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:47:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:24,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 14:47:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:24,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:24,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-20 14:47:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:24,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:24,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-20 14:47:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-20 14:47:24,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:24,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498604987] [2023-12-20 14:47:24,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498604987] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:47:24,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090072077] [2023-12-20 14:47:24,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:24,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:47:24,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:47:24,974 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:47:24,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-20 14:47:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:25,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 14:47:25,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:47:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-20 14:47:25,167 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:47:25,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090072077] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:25,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:47:25,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-20 14:47:25,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305850320] [2023-12-20 14:47:25,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:25,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:47:25,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:25,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:47:25,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:47:25,168 INFO L87 Difference]: Start difference. First operand 5398 states and 7678 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 14:47:25,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:25,635 INFO L93 Difference]: Finished difference Result 10217 states and 15024 transitions. [2023-12-20 14:47:25,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:47:25,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 127 [2023-12-20 14:47:25,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:25,654 INFO L225 Difference]: With dead ends: 10217 [2023-12-20 14:47:25,654 INFO L226 Difference]: Without dead ends: 7306 [2023-12-20 14:47:25,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 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-12-20 14:47:25,665 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 208 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:25,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 406 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:47:25,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2023-12-20 14:47:26,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7270. [2023-12-20 14:47:26,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7270 states, 5981 states have (on average 1.416652733656579) internal successors, (8473), 6066 states have internal predecessors, (8473), 727 states have call successors, (727), 471 states have call predecessors, (727), 560 states have return successors, (1216), 740 states have call predecessors, (1216), 726 states have call successors, (1216) [2023-12-20 14:47:26,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7270 states to 7270 states and 10416 transitions. [2023-12-20 14:47:26,129 INFO L78 Accepts]: Start accepts. Automaton has 7270 states and 10416 transitions. Word has length 127 [2023-12-20 14:47:26,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:26,129 INFO L495 AbstractCegarLoop]: Abstraction has 7270 states and 10416 transitions. [2023-12-20 14:47:26,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 14:47:26,129 INFO L276 IsEmpty]: Start isEmpty. Operand 7270 states and 10416 transitions. [2023-12-20 14:47:26,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-20 14:47:26,137 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:26,137 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-20 14:47:26,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-20 14:47:26,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:47:26,344 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:26,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:26,344 INFO L85 PathProgramCache]: Analyzing trace with hash 668138680, now seen corresponding path program 1 times [2023-12-20 14:47:26,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:26,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613134733] [2023-12-20 14:47:26,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:26,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:26,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:26,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:26,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:47:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:26,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:47:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:26,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:47:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:26,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 14:47:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:26,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:26,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-20 14:47:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:26,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:26,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-20 14:47:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-20 14:47:26,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:26,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613134733] [2023-12-20 14:47:26,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613134733] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:47:26,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225411920] [2023-12-20 14:47:26,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:26,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:47:26,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:47:26,421 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:47:26,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-20 14:47:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:26,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 14:47:26,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:47:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-20 14:47:26,577 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:47:26,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225411920] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:26,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:47:26,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-20 14:47:26,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534607759] [2023-12-20 14:47:26,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:26,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:47:26,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:26,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:47:26,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:47:26,578 INFO L87 Difference]: Start difference. First operand 7270 states and 10416 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-12-20 14:47:27,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:27,166 INFO L93 Difference]: Finished difference Result 18920 states and 27991 transitions. [2023-12-20 14:47:27,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:47:27,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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 127 [2023-12-20 14:47:27,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:27,196 INFO L225 Difference]: With dead ends: 18920 [2023-12-20 14:47:27,196 INFO L226 Difference]: Without dead ends: 12918 [2023-12-20 14:47:27,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 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-12-20 14:47:27,212 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 211 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:27,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 405 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:47:27,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12918 states. [2023-12-20 14:47:27,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12918 to 12853. [2023-12-20 14:47:27,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12853 states, 10598 states have (on average 1.42668428005284) internal successors, (15120), 10755 states have internal predecessors, (15120), 1277 states have call successors, (1277), 830 states have call predecessors, (1277), 976 states have return successors, (2124), 1275 states have call predecessors, (2124), 1276 states have call successors, (2124) [2023-12-20 14:47:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12853 states to 12853 states and 18521 transitions. [2023-12-20 14:47:27,864 INFO L78 Accepts]: Start accepts. Automaton has 12853 states and 18521 transitions. Word has length 127 [2023-12-20 14:47:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:27,864 INFO L495 AbstractCegarLoop]: Abstraction has 12853 states and 18521 transitions. [2023-12-20 14:47:27,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-12-20 14:47:27,864 INFO L276 IsEmpty]: Start isEmpty. Operand 12853 states and 18521 transitions. [2023-12-20 14:47:27,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-20 14:47:27,878 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:27,878 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-12-20 14:47:27,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-20 14:47:28,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-20 14:47:28,083 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:28,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:28,084 INFO L85 PathProgramCache]: Analyzing trace with hash -506822965, now seen corresponding path program 1 times [2023-12-20 14:47:28,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:28,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746779022] [2023-12-20 14:47:28,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:28,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:28,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:28,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:28,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 14:47:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:28,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:47:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:28,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:47:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:28,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 14:47:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:28,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 14:47:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:28,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-20 14:47:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:28,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 14:47:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:28,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 14:47:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:28,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 14:47:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:28,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:47:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:28,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:47:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:28,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-20 14:47:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:28,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-20 14:47:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:28,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-12-20 14:47:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:28,151 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-20 14:47:28,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:28,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746779022] [2023-12-20 14:47:28,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746779022] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:28,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:47:28,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 14:47:28,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368927297] [2023-12-20 14:47:28,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:28,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 14:47:28,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:28,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 14:47:28,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:47:28,152 INFO L87 Difference]: Start difference. First operand 12853 states and 18521 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-12-20 14:47:29,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:29,050 INFO L93 Difference]: Finished difference Result 14008 states and 19909 transitions. [2023-12-20 14:47:29,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-20 14:47:29,060 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-12-20 14:47:29,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:29,123 INFO L225 Difference]: With dead ends: 14008 [2023-12-20 14:47:29,123 INFO L226 Difference]: Without dead ends: 12846 [2023-12-20 14:47:29,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-20 14:47:29,129 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 373 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:29,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 697 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 14:47:29,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12846 states. [2023-12-20 14:47:29,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12846 to 12761. [2023-12-20 14:47:29,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12761 states, 10528 states have (on average 1.4282864741641337) internal successors, (15037), 10685 states have internal predecessors, (15037), 1266 states have call successors, (1266), 821 states have call predecessors, (1266), 965 states have return successors, (2108), 1262 states have call predecessors, (2108), 1265 states have call successors, (2108) [2023-12-20 14:47:29,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12761 states to 12761 states and 18411 transitions. [2023-12-20 14:47:29,733 INFO L78 Accepts]: Start accepts. Automaton has 12761 states and 18411 transitions. Word has length 145 [2023-12-20 14:47:29,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:29,734 INFO L495 AbstractCegarLoop]: Abstraction has 12761 states and 18411 transitions. [2023-12-20 14:47:29,734 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-12-20 14:47:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 12761 states and 18411 transitions. [2023-12-20 14:47:29,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-20 14:47:29,748 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:29,748 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-20 14:47:29,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-20 14:47:29,749 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:29,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:29,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1362634231, now seen corresponding path program 1 times [2023-12-20 14:47:29,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:29,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856595261] [2023-12-20 14:47:29,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:29,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:29,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:29,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:29,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 14:47:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:29,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:47:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:29,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:47:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:29,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 14:47:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:29,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 14:47:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:29,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-20 14:47:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:29,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 14:47:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:29,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-20 14:47:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:29,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-20 14:47:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:29,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:47:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:29,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:47:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:29,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 14:47:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:29,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 14:47:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:29,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 14:47:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-20 14:47:29,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:29,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856595261] [2023-12-20 14:47:29,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856595261] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:47:29,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70609574] [2023-12-20 14:47:29,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:29,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:47:29,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:47:29,944 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:47:29,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-20 14:47:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:30,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-20 14:47:30,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:47:30,166 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-20 14:47:30,166 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:47:30,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70609574] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:30,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:47:30,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2023-12-20 14:47:30,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436346443] [2023-12-20 14:47:30,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:30,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 14:47:30,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:30,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 14:47:30,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-20 14:47:30,167 INFO L87 Difference]: Start difference. First operand 12761 states and 18411 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-20 14:47:30,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:30,962 INFO L93 Difference]: Finished difference Result 14898 states and 21032 transitions. [2023-12-20 14:47:30,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 14:47:30,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 147 [2023-12-20 14:47:30,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:31,000 INFO L225 Difference]: With dead ends: 14898 [2023-12-20 14:47:31,000 INFO L226 Difference]: Without dead ends: 13616 [2023-12-20 14:47:31,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-12-20 14:47:31,011 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 165 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:31,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 421 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 14:47:31,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13616 states. [2023-12-20 14:47:31,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13616 to 13577. [2023-12-20 14:47:31,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13577 states, 11192 states have (on average 1.41234810578985) internal successors, (15807), 11354 states have internal predecessors, (15807), 1340 states have call successors, (1340), 876 states have call predecessors, (1340), 1043 states have return successors, (2224), 1354 states have call predecessors, (2224), 1339 states have call successors, (2224) [2023-12-20 14:47:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13577 states to 13577 states and 19371 transitions. [2023-12-20 14:47:31,823 INFO L78 Accepts]: Start accepts. Automaton has 13577 states and 19371 transitions. Word has length 147 [2023-12-20 14:47:31,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:31,823 INFO L495 AbstractCegarLoop]: Abstraction has 13577 states and 19371 transitions. [2023-12-20 14:47:31,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-20 14:47:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 13577 states and 19371 transitions. [2023-12-20 14:47:31,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-20 14:47:31,837 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:31,837 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-20 14:47:31,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-20 14:47:32,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-20 14:47:32,044 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:32,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:32,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2111036548, now seen corresponding path program 1 times [2023-12-20 14:47:32,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:32,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880123682] [2023-12-20 14:47:32,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:32,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:32,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:32,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:32,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:47:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:32,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:47:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:32,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:47:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:32,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 14:47:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:32,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-20 14:47:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:32,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:32,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-20 14:47:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:32,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:32,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 14:47:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-20 14:47:32,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:32,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880123682] [2023-12-20 14:47:32,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880123682] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:47:32,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103899043] [2023-12-20 14:47:32,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:32,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:47:32,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:47:32,129 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:47:32,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-20 14:47:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:32,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 14:47:32,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:47:32,294 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-20 14:47:32,294 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:47:32,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103899043] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:32,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:47:32,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:47:32,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748095213] [2023-12-20 14:47:32,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:32,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:47:32,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:32,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:47:32,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:47:32,296 INFO L87 Difference]: Start difference. First operand 13577 states and 19371 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 14:47:32,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:32,937 INFO L93 Difference]: Finished difference Result 23668 states and 34406 transitions. [2023-12-20 14:47:32,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:47:32,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 143 [2023-12-20 14:47:32,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:32,968 INFO L225 Difference]: With dead ends: 23668 [2023-12-20 14:47:32,968 INFO L226 Difference]: Without dead ends: 13126 [2023-12-20 14:47:32,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 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-12-20 14:47:32,988 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 230 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:32,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 291 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:47:32,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13126 states. [2023-12-20 14:47:33,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13126 to 10573. [2023-12-20 14:47:33,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10573 states, 8733 states have (on average 1.3565784953624185) internal successors, (11847), 8831 states have internal predecessors, (11847), 1017 states have call successors, (1017), 706 states have call predecessors, (1017), 821 states have return successors, (1608), 1039 states have call predecessors, (1608), 1016 states have call successors, (1608) [2023-12-20 14:47:33,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10573 states to 10573 states and 14472 transitions. [2023-12-20 14:47:33,653 INFO L78 Accepts]: Start accepts. Automaton has 10573 states and 14472 transitions. Word has length 143 [2023-12-20 14:47:33,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:33,653 INFO L495 AbstractCegarLoop]: Abstraction has 10573 states and 14472 transitions. [2023-12-20 14:47:33,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 14:47:33,653 INFO L276 IsEmpty]: Start isEmpty. Operand 10573 states and 14472 transitions. [2023-12-20 14:47:33,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-20 14:47:33,661 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:33,661 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-20 14:47:33,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-20 14:47:33,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:47:33,870 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:33,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:33,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1070527267, now seen corresponding path program 1 times [2023-12-20 14:47:33,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:33,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688349274] [2023-12-20 14:47:33,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:33,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:33,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:33,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:33,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:47:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:33,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:47:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:33,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:47:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:33,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 14:47:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:33,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-20 14:47:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:33,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:33,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-20 14:47:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:33,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:33,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 14:47:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-20 14:47:33,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:33,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688349274] [2023-12-20 14:47:33,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688349274] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:47:33,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756221977] [2023-12-20 14:47:33,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:33,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:47:33,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:47:33,942 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:47:33,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-20 14:47:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:34,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 14:47:34,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:47:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-20 14:47:34,065 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:47:34,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756221977] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:34,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:47:34,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:47:34,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997233349] [2023-12-20 14:47:34,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:34,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:47:34,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:34,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:47:34,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:47:34,067 INFO L87 Difference]: Start difference. First operand 10573 states and 14472 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-12-20 14:47:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:34,617 INFO L93 Difference]: Finished difference Result 19961 states and 27697 transitions. [2023-12-20 14:47:34,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:47:34,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 143 [2023-12-20 14:47:34,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:34,641 INFO L225 Difference]: With dead ends: 19961 [2023-12-20 14:47:34,641 INFO L226 Difference]: Without dead ends: 11381 [2023-12-20 14:47:34,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 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-12-20 14:47:34,657 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 242 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:34,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 404 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:47:34,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11381 states. [2023-12-20 14:47:35,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11381 to 11325. [2023-12-20 14:47:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11325 states, 9408 states have (on average 1.3296130952380953) internal successors, (12509), 9506 states have internal predecessors, (12509), 1031 states have call successors, (1031), 762 states have call predecessors, (1031), 884 states have return successors, (1748), 1060 states have call predecessors, (1748), 1030 states have call successors, (1748) [2023-12-20 14:47:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11325 states to 11325 states and 15288 transitions. [2023-12-20 14:47:35,262 INFO L78 Accepts]: Start accepts. Automaton has 11325 states and 15288 transitions. Word has length 143 [2023-12-20 14:47:35,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:35,262 INFO L495 AbstractCegarLoop]: Abstraction has 11325 states and 15288 transitions. [2023-12-20 14:47:35,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-12-20 14:47:35,263 INFO L276 IsEmpty]: Start isEmpty. Operand 11325 states and 15288 transitions. [2023-12-20 14:47:35,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-20 14:47:35,269 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:35,269 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-20 14:47:35,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-20 14:47:35,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-20 14:47:35,474 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:35,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:35,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1522050028, now seen corresponding path program 1 times [2023-12-20 14:47:35,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:35,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836372057] [2023-12-20 14:47:35,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:35,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:35,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:35,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:35,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:47:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:35,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:47:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:35,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:47:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:35,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 14:47:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:35,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:35,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 14:47:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:35,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-20 14:47:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:35,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:35,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-20 14:47:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:35,562 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-20 14:47:35,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:35,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836372057] [2023-12-20 14:47:35,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836372057] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:47:35,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762693000] [2023-12-20 14:47:35,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:35,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:47:35,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:47:35,563 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:47:35,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-20 14:47:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:35,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 14:47:35,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:47:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-20 14:47:35,663 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:47:35,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762693000] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:35,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:47:35,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:47:35,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964080640] [2023-12-20 14:47:35,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:35,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:47:35,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:35,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:47:35,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:47:35,664 INFO L87 Difference]: Start difference. First operand 11325 states and 15288 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-20 14:47:36,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:36,629 INFO L93 Difference]: Finished difference Result 28687 states and 39680 transitions. [2023-12-20 14:47:36,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:47:36,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 144 [2023-12-20 14:47:36,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:36,673 INFO L225 Difference]: With dead ends: 28687 [2023-12-20 14:47:36,673 INFO L226 Difference]: Without dead ends: 19355 [2023-12-20 14:47:36,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 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-12-20 14:47:36,691 INFO L413 NwaCegarLoop]: 397 mSDtfsCounter, 133 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:36,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 660 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:47:36,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19355 states. [2023-12-20 14:47:37,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19355 to 19353. [2023-12-20 14:47:37,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19353 states, 16061 states have (on average 1.3324824108087914) internal successors, (21401), 16240 states have internal predecessors, (21401), 1799 states have call successors, (1799), 1303 states have call predecessors, (1799), 1491 states have return successors, (3342), 1817 states have call predecessors, (3342), 1798 states have call successors, (3342) [2023-12-20 14:47:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19353 states to 19353 states and 26542 transitions. [2023-12-20 14:47:37,747 INFO L78 Accepts]: Start accepts. Automaton has 19353 states and 26542 transitions. Word has length 144 [2023-12-20 14:47:37,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:37,747 INFO L495 AbstractCegarLoop]: Abstraction has 19353 states and 26542 transitions. [2023-12-20 14:47:37,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-20 14:47:37,747 INFO L276 IsEmpty]: Start isEmpty. Operand 19353 states and 26542 transitions. [2023-12-20 14:47:37,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-20 14:47:37,760 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:37,760 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-20 14:47:37,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-20 14:47:37,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:47:37,961 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:37,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:37,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1796361806, now seen corresponding path program 1 times [2023-12-20 14:47:37,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:37,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599093665] [2023-12-20 14:47:37,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:37,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:38,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:38,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:38,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:47:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:38,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:47:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:38,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:47:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:38,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 14:47:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:38,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:38,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 14:47:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:38,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-20 14:47:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:38,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:38,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-20 14:47:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:38,042 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-20 14:47:38,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:38,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599093665] [2023-12-20 14:47:38,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599093665] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:47:38,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170264677] [2023-12-20 14:47:38,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:38,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:47:38,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:47:38,043 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:47:38,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-20 14:47:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:38,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 14:47:38,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:47:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-20 14:47:38,162 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:47:38,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170264677] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:38,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:47:38,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:47:38,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417418571] [2023-12-20 14:47:38,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:38,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:47:38,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:38,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:47:38,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:47:38,164 INFO L87 Difference]: Start difference. First operand 19353 states and 26542 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-20 14:47:39,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:39,106 INFO L93 Difference]: Finished difference Result 36793 states and 51627 transitions. [2023-12-20 14:47:39,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:47:39,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 145 [2023-12-20 14:47:39,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:39,151 INFO L225 Difference]: With dead ends: 36793 [2023-12-20 14:47:39,151 INFO L226 Difference]: Without dead ends: 20109 [2023-12-20 14:47:39,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 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-12-20 14:47:39,178 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 249 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:39,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 296 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:47:39,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20109 states. [2023-12-20 14:47:40,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20109 to 18455. [2023-12-20 14:47:40,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18455 states, 15307 states have (on average 1.2964656693016268) internal successors, (19845), 15460 states have internal predecessors, (19845), 1727 states have call successors, (1727), 1243 states have call predecessors, (1727), 1419 states have return successors, (2879), 1755 states have call predecessors, (2879), 1726 states have call successors, (2879) [2023-12-20 14:47:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18455 states to 18455 states and 24451 transitions. [2023-12-20 14:47:40,218 INFO L78 Accepts]: Start accepts. Automaton has 18455 states and 24451 transitions. Word has length 145 [2023-12-20 14:47:40,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:40,219 INFO L495 AbstractCegarLoop]: Abstraction has 18455 states and 24451 transitions. [2023-12-20 14:47:40,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-20 14:47:40,219 INFO L276 IsEmpty]: Start isEmpty. Operand 18455 states and 24451 transitions. [2023-12-20 14:47:40,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-20 14:47:40,230 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:40,230 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-20 14:47:40,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-20 14:47:40,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-12-20 14:47:40,435 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:40,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:40,436 INFO L85 PathProgramCache]: Analyzing trace with hash 681942383, now seen corresponding path program 1 times [2023-12-20 14:47:40,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:40,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010699621] [2023-12-20 14:47:40,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:40,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:40,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:40,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:40,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:47:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:40,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:47:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:40,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:47:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:40,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 14:47:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:40,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:40,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 14:47:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:40,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-20 14:47:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:40,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:40,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-20 14:47:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:40,508 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-20 14:47:40,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:40,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010699621] [2023-12-20 14:47:40,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010699621] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:47:40,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997707271] [2023-12-20 14:47:40,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:40,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:47:40,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:47:40,509 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:47:40,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-20 14:47:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:40,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 14:47:40,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:47:40,611 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-20 14:47:40,611 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:47:40,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997707271] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:40,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:47:40,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:47:40,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467210850] [2023-12-20 14:47:40,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:40,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:47:40,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:40,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:47:40,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:47:40,613 INFO L87 Difference]: Start difference. First operand 18455 states and 24451 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-12-20 14:47:42,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:42,314 INFO L93 Difference]: Finished difference Result 50356 states and 68144 transitions. [2023-12-20 14:47:42,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:47:42,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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 145 [2023-12-20 14:47:42,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:42,397 INFO L225 Difference]: With dead ends: 50356 [2023-12-20 14:47:42,397 INFO L226 Difference]: Without dead ends: 33898 [2023-12-20 14:47:42,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 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-12-20 14:47:42,426 INFO L413 NwaCegarLoop]: 398 mSDtfsCounter, 139 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:42,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 657 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:47:42,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33898 states. [2023-12-20 14:47:44,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33898 to 33896. [2023-12-20 14:47:44,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33896 states, 28214 states have (on average 1.2900687601899765) internal successors, (36398), 28503 states have internal predecessors, (36398), 3137 states have call successors, (3137), 2275 states have call predecessors, (3137), 2543 states have return successors, (6095), 3125 states have call predecessors, (6095), 3136 states have call successors, (6095) [2023-12-20 14:47:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33896 states to 33896 states and 45630 transitions. [2023-12-20 14:47:44,263 INFO L78 Accepts]: Start accepts. Automaton has 33896 states and 45630 transitions. Word has length 145 [2023-12-20 14:47:44,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:44,264 INFO L495 AbstractCegarLoop]: Abstraction has 33896 states and 45630 transitions. [2023-12-20 14:47:44,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-12-20 14:47:44,264 INFO L276 IsEmpty]: Start isEmpty. Operand 33896 states and 45630 transitions. [2023-12-20 14:47:44,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-20 14:47:44,282 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:44,282 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-20 14:47:44,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-20 14:47:44,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-12-20 14:47:44,488 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:44,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:44,488 INFO L85 PathProgramCache]: Analyzing trace with hash 433185173, now seen corresponding path program 1 times [2023-12-20 14:47:44,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:44,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521500179] [2023-12-20 14:47:44,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:44,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:44,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:44,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:44,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:47:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:44,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:47:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:44,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:47:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:44,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 14:47:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:44,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-20 14:47:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:44,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:44,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 14:47:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:44,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:44,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-20 14:47:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-20 14:47:44,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:44,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521500179] [2023-12-20 14:47:44,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521500179] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:47:44,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211750871] [2023-12-20 14:47:44,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:44,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:47:44,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:47:44,549 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:47:44,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-20 14:47:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:44,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 14:47:44,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:47:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-20 14:47:44,682 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:47:44,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211750871] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:44,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:47:44,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:47:44,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549826850] [2023-12-20 14:47:44,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:44,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:47:44,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:44,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:47:44,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:47:44,683 INFO L87 Difference]: Start difference. First operand 33896 states and 45630 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 14:47:46,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:46,588 INFO L93 Difference]: Finished difference Result 63166 states and 86524 transitions. [2023-12-20 14:47:46,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:47:46,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 145 [2023-12-20 14:47:46,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:46,655 INFO L225 Difference]: With dead ends: 63166 [2023-12-20 14:47:46,655 INFO L226 Difference]: Without dead ends: 31276 [2023-12-20 14:47:46,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 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-12-20 14:47:46,698 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 239 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:46,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 286 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:47:46,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31276 states. [2023-12-20 14:47:48,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31276 to 26748. [2023-12-20 14:47:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26748 states, 22356 states have (on average 1.247987117552335) internal successors, (27900), 22609 states have internal predecessors, (27900), 2371 states have call successors, (2371), 1775 states have call predecessors, (2371), 2019 states have return successors, (3989), 2371 states have call predecessors, (3989), 2370 states have call successors, (3989) [2023-12-20 14:47:48,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26748 states to 26748 states and 34260 transitions. [2023-12-20 14:47:48,273 INFO L78 Accepts]: Start accepts. Automaton has 26748 states and 34260 transitions. Word has length 145 [2023-12-20 14:47:48,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:48,273 INFO L495 AbstractCegarLoop]: Abstraction has 26748 states and 34260 transitions. [2023-12-20 14:47:48,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 14:47:48,273 INFO L276 IsEmpty]: Start isEmpty. Operand 26748 states and 34260 transitions. [2023-12-20 14:47:48,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-20 14:47:48,285 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:48,285 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-20 14:47:48,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-20 14:47:48,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-12-20 14:47:48,490 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:48,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:48,490 INFO L85 PathProgramCache]: Analyzing trace with hash -184280594, now seen corresponding path program 1 times [2023-12-20 14:47:48,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:48,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457273567] [2023-12-20 14:47:48,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:48,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:48,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:48,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:48,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:47:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:48,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:47:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:48,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:47:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:48,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 14:47:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:48,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-20 14:47:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:48,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:48,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-20 14:47:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:48,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:48,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-12-20 14:47:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-20 14:47:48,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:48,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457273567] [2023-12-20 14:47:48,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457273567] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:47:48,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175555276] [2023-12-20 14:47:48,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:48,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:47:48,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:47:48,551 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:47:48,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-20 14:47:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:48,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 14:47:48,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:47:48,685 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-20 14:47:48,686 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:47:48,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175555276] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:48,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:47:48,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:47:48,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785043445] [2023-12-20 14:47:48,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:48,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:47:48,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:48,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:47:48,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:47:48,687 INFO L87 Difference]: Start difference. First operand 26748 states and 34260 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-12-20 14:47:50,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:50,053 INFO L93 Difference]: Finished difference Result 40922 states and 53988 transitions. [2023-12-20 14:47:50,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:47:50,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 146 [2023-12-20 14:47:50,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:50,112 INFO L225 Difference]: With dead ends: 40922 [2023-12-20 14:47:50,112 INFO L226 Difference]: Without dead ends: 26428 [2023-12-20 14:47:50,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 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-12-20 14:47:50,135 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 98 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:50,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 594 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:47:50,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26428 states. [2023-12-20 14:47:51,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26428 to 26236. [2023-12-20 14:47:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26236 states, 21900 states have (on average 1.2292237442922374) internal successors, (26920), 22125 states have internal predecessors, (26920), 2371 states have call successors, (2371), 1775 states have call predecessors, (2371), 1963 states have return successors, (3887), 2343 states have call predecessors, (3887), 2370 states have call successors, (3887) [2023-12-20 14:47:51,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26236 states to 26236 states and 33178 transitions. [2023-12-20 14:47:51,830 INFO L78 Accepts]: Start accepts. Automaton has 26236 states and 33178 transitions. Word has length 146 [2023-12-20 14:47:51,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:51,831 INFO L495 AbstractCegarLoop]: Abstraction has 26236 states and 33178 transitions. [2023-12-20 14:47:51,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-12-20 14:47:51,831 INFO L276 IsEmpty]: Start isEmpty. Operand 26236 states and 33178 transitions. [2023-12-20 14:47:51,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-20 14:47:51,843 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:51,843 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-20 14:47:51,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-20 14:47:52,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-12-20 14:47:52,044 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:52,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:52,044 INFO L85 PathProgramCache]: Analyzing trace with hash -685458390, now seen corresponding path program 1 times [2023-12-20 14:47:52,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:52,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005093515] [2023-12-20 14:47:52,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:52,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:52,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:52,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:52,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:47:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:52,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:47:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:52,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:47:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:52,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 14:47:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:52,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-20 14:47:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:52,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:52,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-20 14:47:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:52,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:52,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 14:47:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:52,102 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-20 14:47:52,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:52,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005093515] [2023-12-20 14:47:52,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005093515] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:47:52,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158253842] [2023-12-20 14:47:52,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:52,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:47:52,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:47:52,104 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:47:52,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-20 14:47:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:52,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 14:47:52,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:47:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-12-20 14:47:52,257 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:47:52,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158253842] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:52,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:47:52,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-20 14:47:52,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933390269] [2023-12-20 14:47:52,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:52,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 14:47:52,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:52,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 14:47:52,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-20 14:47:52,259 INFO L87 Difference]: Start difference. First operand 26236 states and 33178 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 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-12-20 14:47:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:54,401 INFO L93 Difference]: Finished difference Result 50474 states and 64600 transitions. [2023-12-20 14:47:54,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 14:47:54,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 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 147 [2023-12-20 14:47:54,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:54,444 INFO L225 Difference]: With dead ends: 50474 [2023-12-20 14:47:54,444 INFO L226 Difference]: Without dead ends: 26236 [2023-12-20 14:47:54,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 166 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-12-20 14:47:54,464 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 318 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:54,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 376 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 14:47:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26236 states. [2023-12-20 14:47:55,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26236 to 26236. [2023-12-20 14:47:55,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26236 states, 21900 states have (on average 1.1956164383561645) internal successors, (26184), 22125 states have internal predecessors, (26184), 2371 states have call successors, (2371), 1775 states have call predecessors, (2371), 1963 states have return successors, (3887), 2343 states have call predecessors, (3887), 2370 states have call successors, (3887) [2023-12-20 14:47:55,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26236 states to 26236 states and 32442 transitions. [2023-12-20 14:47:55,969 INFO L78 Accepts]: Start accepts. Automaton has 26236 states and 32442 transitions. Word has length 147 [2023-12-20 14:47:55,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:55,970 INFO L495 AbstractCegarLoop]: Abstraction has 26236 states and 32442 transitions. [2023-12-20 14:47:55,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 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-12-20 14:47:55,970 INFO L276 IsEmpty]: Start isEmpty. Operand 26236 states and 32442 transitions. [2023-12-20 14:47:55,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-20 14:47:55,985 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:55,985 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-20 14:47:55,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-20 14:47:56,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:47:56,186 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:56,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:56,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1467648428, now seen corresponding path program 1 times [2023-12-20 14:47:56,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:56,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183966030] [2023-12-20 14:47:56,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:56,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:56,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:56,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:56,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:47:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:56,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:47:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:56,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:47:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:56,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 14:47:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:56,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-20 14:47:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:56,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:56,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-20 14:47:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:56,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:56,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 14:47:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-20 14:47:56,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:56,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183966030] [2023-12-20 14:47:56,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183966030] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:47:56,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131913117] [2023-12-20 14:47:56,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:56,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:47:56,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:47:56,269 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:47:56,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-20 14:47:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:56,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 14:47:56,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:47:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-12-20 14:47:56,499 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:47:56,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131913117] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:56,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:47:56,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-20 14:47:56,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588991119] [2023-12-20 14:47:56,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:56,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 14:47:56,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:56,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 14:47:56,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-20 14:47:56,501 INFO L87 Difference]: Start difference. First operand 26236 states and 32442 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 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-12-20 14:47:57,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:47:57,926 INFO L93 Difference]: Finished difference Result 39382 states and 49287 transitions. [2023-12-20 14:47:57,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 14:47:57,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 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 147 [2023-12-20 14:47:57,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:47:57,967 INFO L225 Difference]: With dead ends: 39382 [2023-12-20 14:47:57,967 INFO L226 Difference]: Without dead ends: 21768 [2023-12-20 14:47:57,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 166 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-12-20 14:47:57,989 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 314 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 14:47:57,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 369 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 14:47:58,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21768 states. [2023-12-20 14:47:59,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21768 to 16284. [2023-12-20 14:47:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16284 states, 13610 states have (on average 1.1722997795738428) internal successors, (15955), 13733 states have internal predecessors, (15955), 1473 states have call successors, (1473), 1081 states have call predecessors, (1473), 1199 states have return successors, (2389), 1473 states have call predecessors, (2389), 1472 states have call successors, (2389) [2023-12-20 14:47:59,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16284 states to 16284 states and 19817 transitions. [2023-12-20 14:47:59,190 INFO L78 Accepts]: Start accepts. Automaton has 16284 states and 19817 transitions. Word has length 147 [2023-12-20 14:47:59,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:47:59,190 INFO L495 AbstractCegarLoop]: Abstraction has 16284 states and 19817 transitions. [2023-12-20 14:47:59,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 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-12-20 14:47:59,190 INFO L276 IsEmpty]: Start isEmpty. Operand 16284 states and 19817 transitions. [2023-12-20 14:47:59,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-20 14:47:59,196 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:47:59,196 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-20 14:47:59,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-20 14:47:59,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:47:59,397 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:47:59,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:47:59,397 INFO L85 PathProgramCache]: Analyzing trace with hash -505516950, now seen corresponding path program 1 times [2023-12-20 14:47:59,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:47:59,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390822760] [2023-12-20 14:47:59,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:59,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:47:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:59,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:47:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:59,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:47:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:59,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:47:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:59,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:47:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:59,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:47:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:59,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 14:47:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:59,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-20 14:47:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:59,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:59,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-20 14:47:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:59,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:47:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:59,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 14:47:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:59,479 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-20 14:47:59,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:47:59,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390822760] [2023-12-20 14:47:59,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390822760] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:47:59,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130007545] [2023-12-20 14:47:59,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:47:59,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:47:59,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:47:59,484 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:47:59,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-20 14:47:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:47:59,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-20 14:47:59,573 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:47:59,632 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-20 14:47:59,632 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:47:59,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130007545] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:47:59,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:47:59,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2023-12-20 14:47:59,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322778554] [2023-12-20 14:47:59,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:47:59,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 14:47:59,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:47:59,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 14:47:59,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-20 14:47:59,634 INFO L87 Difference]: Start difference. First operand 16284 states and 19817 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-20 14:48:00,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:48:00,811 INFO L93 Difference]: Finished difference Result 26768 states and 32749 transitions. [2023-12-20 14:48:00,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 14:48:00,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 147 [2023-12-20 14:48:00,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:48:00,836 INFO L225 Difference]: With dead ends: 26768 [2023-12-20 14:48:00,836 INFO L226 Difference]: Without dead ends: 16322 [2023-12-20 14:48:00,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-20 14:48:00,845 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 306 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 14:48:00,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 424 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 14:48:00,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16322 states. [2023-12-20 14:48:01,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16322 to 16320. [2023-12-20 14:48:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16320 states, 13628 states have (on average 1.1660551805107133) internal successors, (15891), 13760 states have internal predecessors, (15891), 1473 states have call successors, (1473), 1081 states have call predecessors, (1473), 1217 states have return successors, (2389), 1482 states have call predecessors, (2389), 1472 states have call successors, (2389) [2023-12-20 14:48:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16320 states to 16320 states and 19753 transitions. [2023-12-20 14:48:01,886 INFO L78 Accepts]: Start accepts. Automaton has 16320 states and 19753 transitions. Word has length 147 [2023-12-20 14:48:01,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:48:01,887 INFO L495 AbstractCegarLoop]: Abstraction has 16320 states and 19753 transitions. [2023-12-20 14:48:01,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-20 14:48:01,887 INFO L276 IsEmpty]: Start isEmpty. Operand 16320 states and 19753 transitions. [2023-12-20 14:48:01,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-20 14:48:01,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:48:01,893 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-20 14:48:01,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-12-20 14:48:02,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-12-20 14:48:02,094 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:48:02,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:48:02,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2001580524, now seen corresponding path program 1 times [2023-12-20 14:48:02,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:48:02,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82364869] [2023-12-20 14:48:02,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:48:02,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:48:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:02,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:48:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:02,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:48:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:02,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:48:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:02,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:48:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:02,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:48:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:02,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 14:48:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:02,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-20 14:48:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:02,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:48:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:02,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-20 14:48:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:02,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:48:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:02,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 14:48:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:02,146 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-12-20 14:48:02,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:48:02,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82364869] [2023-12-20 14:48:02,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82364869] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:48:02,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:48:02,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 14:48:02,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641318634] [2023-12-20 14:48:02,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:48:02,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 14:48:02,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:48:02,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 14:48:02,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 14:48:02,148 INFO L87 Difference]: Start difference. First operand 16320 states and 19753 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-20 14:48:03,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:48:03,144 INFO L93 Difference]: Finished difference Result 18853 states and 22739 transitions. [2023-12-20 14:48:03,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 14:48:03,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 147 [2023-12-20 14:48:03,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:48:03,177 INFO L225 Difference]: With dead ends: 18853 [2023-12-20 14:48:03,177 INFO L226 Difference]: Without dead ends: 15011 [2023-12-20 14:48:03,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-20 14:48:03,189 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 357 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 14:48:03,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 400 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 14:48:03,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15011 states. [2023-12-20 14:48:04,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15011 to 14026. [2023-12-20 14:48:04,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14026 states, 11805 states have (on average 1.1689114781872088) internal successors, (13799), 12023 states have internal predecessors, (13799), 1111 states have call successors, (1111), 823 states have call predecessors, (1111), 1108 states have return successors, (2114), 1181 states have call predecessors, (2114), 1110 states have call successors, (2114) [2023-12-20 14:48:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14026 states to 14026 states and 17024 transitions. [2023-12-20 14:48:04,044 INFO L78 Accepts]: Start accepts. Automaton has 14026 states and 17024 transitions. Word has length 147 [2023-12-20 14:48:04,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:48:04,044 INFO L495 AbstractCegarLoop]: Abstraction has 14026 states and 17024 transitions. [2023-12-20 14:48:04,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-20 14:48:04,045 INFO L276 IsEmpty]: Start isEmpty. Operand 14026 states and 17024 transitions. [2023-12-20 14:48:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-20 14:48:04,049 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:48:04,049 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-20 14:48:04,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-20 14:48:04,049 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:48:04,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:48:04,050 INFO L85 PathProgramCache]: Analyzing trace with hash 141749920, now seen corresponding path program 1 times [2023-12-20 14:48:04,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:48:04,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911588544] [2023-12-20 14:48:04,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:48:04,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:48:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:04,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:48:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:04,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:48:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:04,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:48:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:04,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:48:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:04,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:48:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:04,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 14:48:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:04,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 14:48:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:04,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:48:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:04,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 14:48:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:04,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:48:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:04,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-20 14:48:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-20 14:48:04,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:48:04,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911588544] [2023-12-20 14:48:04,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911588544] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:48:04,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75332464] [2023-12-20 14:48:04,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:48:04,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:48:04,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:48:04,118 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:48:04,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-20 14:48:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:04,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-20 14:48:04,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:48:04,216 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-20 14:48:04,216 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:48:04,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75332464] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:48:04,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:48:04,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-20 14:48:04,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722837076] [2023-12-20 14:48:04,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:48:04,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 14:48:04,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:48:04,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 14:48:04,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 14:48:04,218 INFO L87 Difference]: Start difference. First operand 14026 states and 17024 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-12-20 14:48:04,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:48:04,939 INFO L93 Difference]: Finished difference Result 23026 states and 28294 transitions. [2023-12-20 14:48:04,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 14:48:04,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 151 [2023-12-20 14:48:04,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:48:04,955 INFO L225 Difference]: With dead ends: 23026 [2023-12-20 14:48:04,955 INFO L226 Difference]: Without dead ends: 8992 [2023-12-20 14:48:04,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 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-12-20 14:48:04,971 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 20 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:48:04,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 753 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:48:04,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8992 states. [2023-12-20 14:48:05,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8992 to 8878. [2023-12-20 14:48:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8878 states, 7399 states have (on average 1.1523178807947019) internal successors, (8526), 7511 states have internal predecessors, (8526), 747 states have call successors, (747), 559 states have call predecessors, (747), 730 states have return successors, (1146), 809 states have call predecessors, (1146), 746 states have call successors, (1146) [2023-12-20 14:48:05,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 10419 transitions. [2023-12-20 14:48:05,498 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 10419 transitions. Word has length 151 [2023-12-20 14:48:05,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:48:05,498 INFO L495 AbstractCegarLoop]: Abstraction has 8878 states and 10419 transitions. [2023-12-20 14:48:05,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-12-20 14:48:05,498 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 10419 transitions. [2023-12-20 14:48:05,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-20 14:48:05,502 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:48:05,503 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-20 14:48:05,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-12-20 14:48:05,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-12-20 14:48:05,703 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:48:05,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:48:05,703 INFO L85 PathProgramCache]: Analyzing trace with hash 152028687, now seen corresponding path program 1 times [2023-12-20 14:48:05,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:48:05,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944309127] [2023-12-20 14:48:05,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:48:05,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:48:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:05,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:48:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:05,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:48:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:05,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:48:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:05,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:48:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:05,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:48:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:05,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 14:48:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:05,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 14:48:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:05,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:48:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:05,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-20 14:48:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:05,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:48:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:05,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 14:48:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:05,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:48:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:05,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-12-20 14:48:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-20 14:48:05,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:48:05,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944309127] [2023-12-20 14:48:05,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944309127] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:48:05,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287166262] [2023-12-20 14:48:05,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:48:05,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:48:05,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:48:05,771 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:48:05,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-20 14:48:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:05,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 14:48:05,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:48:05,897 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-20 14:48:05,897 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:48:05,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287166262] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:48:05,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:48:05,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:48:05,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267805407] [2023-12-20 14:48:05,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:48:05,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:48:05,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:48:05,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:48:05,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:48:05,898 INFO L87 Difference]: Start difference. First operand 8878 states and 10419 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-20 14:48:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:48:06,470 INFO L93 Difference]: Finished difference Result 13686 states and 16472 transitions. [2023-12-20 14:48:06,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:48:06,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 181 [2023-12-20 14:48:06,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:48:06,487 INFO L225 Difference]: With dead ends: 13686 [2023-12-20 14:48:06,487 INFO L226 Difference]: Without dead ends: 8888 [2023-12-20 14:48:06,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 206 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-12-20 14:48:06,499 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 111 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:48:06,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 593 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:48:06,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8888 states. [2023-12-20 14:48:07,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8888 to 8878. [2023-12-20 14:48:07,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8878 states, 7399 states have (on average 1.131504257332072) internal successors, (8372), 7511 states have internal predecessors, (8372), 747 states have call successors, (747), 559 states have call predecessors, (747), 730 states have return successors, (1146), 809 states have call predecessors, (1146), 746 states have call successors, (1146) [2023-12-20 14:48:07,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 10265 transitions. [2023-12-20 14:48:07,034 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 10265 transitions. Word has length 181 [2023-12-20 14:48:07,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:48:07,034 INFO L495 AbstractCegarLoop]: Abstraction has 8878 states and 10265 transitions. [2023-12-20 14:48:07,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-20 14:48:07,034 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 10265 transitions. [2023-12-20 14:48:07,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-20 14:48:07,039 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:48:07,039 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-20 14:48:07,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-12-20 14:48:07,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-12-20 14:48:07,244 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:48:07,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:48:07,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1901364559, now seen corresponding path program 1 times [2023-12-20 14:48:07,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:48:07,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271460912] [2023-12-20 14:48:07,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:48:07,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:48:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:07,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:48:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:07,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:48:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:07,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:48:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:07,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:48:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:07,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:48:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:07,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 14:48:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:07,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 14:48:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:07,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:48:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:07,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 14:48:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:07,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:48:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:07,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 14:48:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:07,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:48:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:07,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 14:48:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:07,317 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-20 14:48:07,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:48:07,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271460912] [2023-12-20 14:48:07,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271460912] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:48:07,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826201950] [2023-12-20 14:48:07,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:48:07,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:48:07,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:48:07,319 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:48:07,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-20 14:48:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:07,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-20 14:48:07,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:48:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 82 proven. 61 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-20 14:48:07,548 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 14:48:07,615 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-20 14:48:07,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826201950] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-20 14:48:07,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-20 14:48:07,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 9 [2023-12-20 14:48:07,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656475533] [2023-12-20 14:48:07,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:48:07,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 14:48:07,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:48:07,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 14:48:07,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-20 14:48:07,617 INFO L87 Difference]: Start difference. First operand 8878 states and 10265 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-20 14:48:08,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:48:08,855 INFO L93 Difference]: Finished difference Result 22084 states and 25362 transitions. [2023-12-20 14:48:08,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 14:48:08,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 183 [2023-12-20 14:48:08,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:48:08,888 INFO L225 Difference]: With dead ends: 22084 [2023-12-20 14:48:08,888 INFO L226 Difference]: Without dead ends: 18642 [2023-12-20 14:48:08,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-20 14:48:08,901 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 490 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 14:48:08,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1263 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 14:48:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18642 states. [2023-12-20 14:48:09,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18642 to 16495. [2023-12-20 14:48:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16495 states, 13816 states have (on average 1.1234800231615518) internal successors, (15522), 14018 states have internal predecessors, (15522), 1379 states have call successors, (1379), 1009 states have call predecessors, (1379), 1298 states have return successors, (2030), 1469 states have call predecessors, (2030), 1378 states have call successors, (2030) [2023-12-20 14:48:10,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16495 states to 16495 states and 18931 transitions. [2023-12-20 14:48:10,020 INFO L78 Accepts]: Start accepts. Automaton has 16495 states and 18931 transitions. Word has length 183 [2023-12-20 14:48:10,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:48:10,020 INFO L495 AbstractCegarLoop]: Abstraction has 16495 states and 18931 transitions. [2023-12-20 14:48:10,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-20 14:48:10,021 INFO L276 IsEmpty]: Start isEmpty. Operand 16495 states and 18931 transitions. [2023-12-20 14:48:10,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-12-20 14:48:10,030 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:48:10,030 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-20 14:48:10,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-12-20 14:48:10,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:48:10,235 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:48:10,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:48:10,236 INFO L85 PathProgramCache]: Analyzing trace with hash -294932154, now seen corresponding path program 1 times [2023-12-20 14:48:10,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:48:10,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670930539] [2023-12-20 14:48:10,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:48:10,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:48:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:48:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:48:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 14:48:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:48:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:48:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 14:48:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 14:48:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-20 14:48:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 14:48:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-20 14:48:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-20 14:48:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:48:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:48:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 14:48:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 14:48:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 14:48:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 14:48:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-12-20 14:48:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 14:48:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-12-20 14:48:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:48:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:48:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-12-20 14:48:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-12-20 14:48:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-20 14:48:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,346 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2023-12-20 14:48:10,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:48:10,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670930539] [2023-12-20 14:48:10,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670930539] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:48:10,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714676478] [2023-12-20 14:48:10,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:48:10,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:48:10,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:48:10,348 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:48:10,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-20 14:48:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:10,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-20 14:48:10,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:48:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-12-20 14:48:10,501 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:48:10,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714676478] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:48:10,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:48:10,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2023-12-20 14:48:10,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854801987] [2023-12-20 14:48:10,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:48:10,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 14:48:10,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:48:10,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 14:48:10,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-20 14:48:10,502 INFO L87 Difference]: Start difference. First operand 16495 states and 18931 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 3 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-20 14:48:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:48:11,696 INFO L93 Difference]: Finished difference Result 18821 states and 21710 transitions. [2023-12-20 14:48:11,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 14:48:11,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 3 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 230 [2023-12-20 14:48:11,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:48:11,727 INFO L225 Difference]: With dead ends: 18821 [2023-12-20 14:48:11,727 INFO L226 Difference]: Without dead ends: 16929 [2023-12-20 14:48:11,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-20 14:48:11,735 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 291 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 14:48:11,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 395 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 14:48:11,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16929 states. [2023-12-20 14:48:12,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16929 to 16919. [2023-12-20 14:48:12,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16919 states, 14135 states have (on average 1.1238061549345597) internal successors, (15885), 14352 states have internal predecessors, (15885), 1425 states have call successors, (1425), 1047 states have call predecessors, (1425), 1357 states have return successors, (2092), 1521 states have call predecessors, (2092), 1424 states have call successors, (2092) [2023-12-20 14:48:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16919 states to 16919 states and 19402 transitions. [2023-12-20 14:48:12,933 INFO L78 Accepts]: Start accepts. Automaton has 16919 states and 19402 transitions. Word has length 230 [2023-12-20 14:48:12,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:48:12,934 INFO L495 AbstractCegarLoop]: Abstraction has 16919 states and 19402 transitions. [2023-12-20 14:48:12,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 3 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-20 14:48:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 16919 states and 19402 transitions. [2023-12-20 14:48:12,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-12-20 14:48:12,945 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:48:12,945 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-20 14:48:12,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-12-20 14:48:13,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2023-12-20 14:48:13,146 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:48:13,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:48:13,146 INFO L85 PathProgramCache]: Analyzing trace with hash -240539256, now seen corresponding path program 1 times [2023-12-20 14:48:13,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:48:13,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058649195] [2023-12-20 14:48:13,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:48:13,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:48:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:48:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:48:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 14:48:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:48:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:48:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 14:48:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 14:48:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-20 14:48:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 14:48:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-20 14:48:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-20 14:48:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:48:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:48:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 14:48:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 14:48:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 14:48:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 14:48:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-12-20 14:48:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 14:48:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-12-20 14:48:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:48:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:48:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-12-20 14:48:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-12-20 14:48:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-20 14:48:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2023-12-20 14:48:13,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:48:13,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058649195] [2023-12-20 14:48:13,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058649195] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:48:13,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99211822] [2023-12-20 14:48:13,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:48:13,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:48:13,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:48:13,227 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:48:13,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-12-20 14:48:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:13,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-20 14:48:13,334 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:48:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 229 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-20 14:48:13,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 14:48:13,572 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 102 proven. 7 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-12-20 14:48:13,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99211822] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 14:48:13,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 14:48:13,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2023-12-20 14:48:13,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052192201] [2023-12-20 14:48:13,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 14:48:13,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-20 14:48:13,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:48:13,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-20 14:48:13,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-12-20 14:48:13,574 INFO L87 Difference]: Start difference. First operand 16919 states and 19402 transitions. Second operand has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 8 states have internal predecessors, (206), 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-12-20 14:48:15,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:48:15,162 INFO L93 Difference]: Finished difference Result 17899 states and 20554 transitions. [2023-12-20 14:48:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-20 14:48:15,162 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 8 states have internal predecessors, (206), 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-12-20 14:48:15,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:48:15,191 INFO L225 Difference]: With dead ends: 17899 [2023-12-20 14:48:15,191 INFO L226 Difference]: Without dead ends: 15565 [2023-12-20 14:48:15,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 508 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=429, Unknown=0, NotChecked=0, Total=600 [2023-12-20 14:48:15,199 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 644 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 14:48:15,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 886 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 14:48:15,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15565 states. [2023-12-20 14:48:16,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15565 to 15412. [2023-12-20 14:48:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15412 states, 12926 states have (on average 1.1169735416989015) internal successors, (14438), 13121 states have internal predecessors, (14438), 1287 states have call successors, (1287), 943 states have call predecessors, (1287), 1197 states have return successors, (1891), 1349 states have call predecessors, (1891), 1286 states have call successors, (1891) [2023-12-20 14:48:16,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15412 states to 15412 states and 17616 transitions. [2023-12-20 14:48:16,275 INFO L78 Accepts]: Start accepts. Automaton has 15412 states and 17616 transitions. Word has length 230 [2023-12-20 14:48:16,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:48:16,275 INFO L495 AbstractCegarLoop]: Abstraction has 15412 states and 17616 transitions. [2023-12-20 14:48:16,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 8 states have internal predecessors, (206), 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-12-20 14:48:16,276 INFO L276 IsEmpty]: Start isEmpty. Operand 15412 states and 17616 transitions. [2023-12-20 14:48:16,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2023-12-20 14:48:16,285 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:48:16,285 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 4, 4, 4, 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, 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-12-20 14:48:16,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-12-20 14:48:16,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:48:16,486 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:48:16,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:48:16,486 INFO L85 PathProgramCache]: Analyzing trace with hash 899077440, now seen corresponding path program 1 times [2023-12-20 14:48:16,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:48:16,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759935015] [2023-12-20 14:48:16,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:48:16,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:48:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:48:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:48:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 14:48:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:48:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:48:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 14:48:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 14:48:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 14:48:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-20 14:48:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 14:48:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-20 14:48:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-20 14:48:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:48:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:48:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 14:48:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 14:48:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-20 14:48:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-12-20 14:48:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-12-20 14:48:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-12-20 14:48:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-12-20 14:48:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:48:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:48:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2023-12-20 14:48:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2023-12-20 14:48:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-20 14:48:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,554 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 79 proven. 9 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2023-12-20 14:48:16,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:48:16,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759935015] [2023-12-20 14:48:16,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759935015] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:48:16,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823374733] [2023-12-20 14:48:16,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:48:16,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:48:16,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:48:16,556 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:48:16,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-20 14:48:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:16,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 14:48:16,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:48:16,711 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2023-12-20 14:48:16,711 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:48:16,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823374733] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:48:16,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:48:16,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2023-12-20 14:48:16,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376252830] [2023-12-20 14:48:16,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:48:16,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:48:16,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:48:16,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:48:16,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:48:16,712 INFO L87 Difference]: Start difference. First operand 15412 states and 17616 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-20 14:48:17,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:48:17,623 INFO L93 Difference]: Finished difference Result 16213 states and 18569 transitions. [2023-12-20 14:48:17,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:48:17,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 233 [2023-12-20 14:48:17,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:48:17,652 INFO L225 Difference]: With dead ends: 16213 [2023-12-20 14:48:17,652 INFO L226 Difference]: Without dead ends: 15404 [2023-12-20 14:48:17,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:48:17,658 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 71 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:48:17,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 494 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:48:17,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15404 states. [2023-12-20 14:48:18,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15404 to 15401. [2023-12-20 14:48:18,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15401 states, 12916 states have (on average 1.115980179622174) internal successors, (14414), 13111 states have internal predecessors, (14414), 1287 states have call successors, (1287), 943 states have call predecessors, (1287), 1196 states have return successors, (1890), 1348 states have call predecessors, (1890), 1286 states have call successors, (1890) [2023-12-20 14:48:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15401 states to 15401 states and 17591 transitions. [2023-12-20 14:48:18,717 INFO L78 Accepts]: Start accepts. Automaton has 15401 states and 17591 transitions. Word has length 233 [2023-12-20 14:48:18,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:48:18,717 INFO L495 AbstractCegarLoop]: Abstraction has 15401 states and 17591 transitions. [2023-12-20 14:48:18,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-20 14:48:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 15401 states and 17591 transitions. [2023-12-20 14:48:18,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2023-12-20 14:48:18,726 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:48:18,726 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 4, 4, 4, 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, 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] [2023-12-20 14:48:18,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-12-20 14:48:18,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:48:18,926 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:48:18,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:48:18,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1559333397, now seen corresponding path program 1 times [2023-12-20 14:48:18,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:48:18,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230933331] [2023-12-20 14:48:18,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:48:18,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:48:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:18,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:48:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:18,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:48:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:18,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 14:48:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:18,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:48:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:18,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:48:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:18,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 14:48:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:18,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 14:48:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:18,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 14:48:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:18,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-20 14:48:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:18,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 14:48:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:18,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-20 14:48:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:18,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-20 14:48:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:18,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:48:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:18,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:48:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:18,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 14:48:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:18,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-20 14:48:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:18,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-20 14:48:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:18,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-20 14:48:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:18,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-12-20 14:48:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:18,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-12-20 14:48:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:19,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2023-12-20 14:48:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:19,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 14:48:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:19,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:48:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:19,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-12-20 14:48:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:19,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-12-20 14:48:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:19,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-12-20 14:48:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 72 proven. 11 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2023-12-20 14:48:19,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:48:19,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230933331] [2023-12-20 14:48:19,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230933331] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:48:19,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424584295] [2023-12-20 14:48:19,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:48:19,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:48:19,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:48:19,019 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:48:19,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-20 14:48:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:19,123 INFO L262 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-20 14:48:19,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:48:19,159 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-20 14:48:19,159 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:48:19,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424584295] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:48:19,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:48:19,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2023-12-20 14:48:19,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353088162] [2023-12-20 14:48:19,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:48:19,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 14:48:19,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:48:19,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 14:48:19,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-20 14:48:19,160 INFO L87 Difference]: Start difference. First operand 15401 states and 17591 transitions. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 3 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-12-20 14:48:20,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:48:20,213 INFO L93 Difference]: Finished difference Result 15664 states and 17880 transitions. [2023-12-20 14:48:20,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 14:48:20,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 3 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 234 [2023-12-20 14:48:20,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:48:20,240 INFO L225 Difference]: With dead ends: 15664 [2023-12-20 14:48:20,240 INFO L226 Difference]: Without dead ends: 14513 [2023-12-20 14:48:20,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-20 14:48:20,248 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 103 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 14:48:20,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 539 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 14:48:20,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14513 states. [2023-12-20 14:48:21,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14513 to 14513. [2023-12-20 14:48:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14513 states, 12226 states have (on average 1.1149190250286276) internal successors, (13631), 12411 states have internal predecessors, (13631), 1191 states have call successors, (1191), 862 states have call predecessors, (1191), 1095 states have return successors, (1753), 1241 states have call predecessors, (1753), 1191 states have call successors, (1753) [2023-12-20 14:48:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14513 states to 14513 states and 16575 transitions. [2023-12-20 14:48:21,247 INFO L78 Accepts]: Start accepts. Automaton has 14513 states and 16575 transitions. Word has length 234 [2023-12-20 14:48:21,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:48:21,247 INFO L495 AbstractCegarLoop]: Abstraction has 14513 states and 16575 transitions. [2023-12-20 14:48:21,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 3 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-12-20 14:48:21,247 INFO L276 IsEmpty]: Start isEmpty. Operand 14513 states and 16575 transitions. [2023-12-20 14:48:21,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2023-12-20 14:48:21,256 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:48:21,256 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2023-12-20 14:48:21,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-12-20 14:48:21,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:48:21,456 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:48:21,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:48:21,457 INFO L85 PathProgramCache]: Analyzing trace with hash 459810019, now seen corresponding path program 1 times [2023-12-20 14:48:21,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:48:21,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570289677] [2023-12-20 14:48:21,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:48:21,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:48:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:21,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:48:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:21,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:48:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:21,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:48:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:21,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:48:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:21,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:48:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:21,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 14:48:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:21,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 14:48:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:21,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:48:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:21,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 14:48:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:21,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:48:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:21,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 14:48:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:21,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:48:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:21,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 14:48:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:21,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2023-12-20 14:48:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:21,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:48:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:21,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2023-12-20 14:48:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:21,535 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2023-12-20 14:48:21,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:48:21,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570289677] [2023-12-20 14:48:21,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570289677] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:48:21,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533934745] [2023-12-20 14:48:21,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:48:21,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:48:21,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:48:21,536 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:48:21,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-12-20 14:48:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:21,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-20 14:48:21,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:48:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2023-12-20 14:48:21,680 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:48:21,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533934745] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:48:21,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:48:21,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2023-12-20 14:48:21,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677181105] [2023-12-20 14:48:21,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:48:21,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 14:48:21,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:48:21,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 14:48:21,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-20 14:48:21,685 INFO L87 Difference]: Start difference. First operand 14513 states and 16575 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-20 14:48:22,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:48:22,539 INFO L93 Difference]: Finished difference Result 22657 states and 25994 transitions. [2023-12-20 14:48:22,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 14:48:22,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 226 [2023-12-20 14:48:22,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:48:22,567 INFO L225 Difference]: With dead ends: 22657 [2023-12-20 14:48:22,567 INFO L226 Difference]: Without dead ends: 14537 [2023-12-20 14:48:22,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-20 14:48:22,580 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 2 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:48:22,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 429 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:48:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14537 states. [2023-12-20 14:48:23,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14537 to 14513. [2023-12-20 14:48:23,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14513 states, 12226 states have (on average 1.1125470309177163) internal successors, (13602), 12411 states have internal predecessors, (13602), 1191 states have call successors, (1191), 862 states have call predecessors, (1191), 1095 states have return successors, (1753), 1241 states have call predecessors, (1753), 1191 states have call successors, (1753) [2023-12-20 14:48:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14513 states to 14513 states and 16546 transitions. [2023-12-20 14:48:23,567 INFO L78 Accepts]: Start accepts. Automaton has 14513 states and 16546 transitions. Word has length 226 [2023-12-20 14:48:23,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:48:23,568 INFO L495 AbstractCegarLoop]: Abstraction has 14513 states and 16546 transitions. [2023-12-20 14:48:23,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-20 14:48:23,568 INFO L276 IsEmpty]: Start isEmpty. Operand 14513 states and 16546 transitions. [2023-12-20 14:48:23,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-12-20 14:48:23,576 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:48:23,576 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:48:23,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-12-20 14:48:23,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:48:23,777 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:48:23,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:48:23,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1094532515, now seen corresponding path program 2 times [2023-12-20 14:48:23,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:48:23,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160313589] [2023-12-20 14:48:23,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:48:23,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:48:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:23,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:48:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:23,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 14:48:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:23,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:48:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:23,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:48:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:23,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 14:48:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:23,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 14:48:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:23,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 14:48:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:23,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:48:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:23,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 14:48:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:23,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:48:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:23,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 14:48:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:23,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:48:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:23,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 14:48:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:23,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2023-12-20 14:48:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:23,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:48:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:23,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-20 14:48:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:48:23,851 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2023-12-20 14:48:23,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:48:23,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160313589] [2023-12-20 14:48:23,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160313589] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:48:23,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246390798] [2023-12-20 14:48:23,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-20 14:48:23,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:48:23,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:48:23,852 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:48:23,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-20 14:48:23,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-20 14:48:23,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-20 14:48:23,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-20 14:48:23,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:48:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2023-12-20 14:48:23,936 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:48:23,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246390798] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:48:23,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:48:23,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-20 14:48:23,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965789628] [2023-12-20 14:48:23,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:48:23,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 14:48:23,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:48:23,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 14:48:23,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 14:48:23,938 INFO L87 Difference]: Start difference. First operand 14513 states and 16546 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-20 14:48:24,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:48:24,239 INFO L93 Difference]: Finished difference Result 17862 states and 20411 transitions. [2023-12-20 14:48:24,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 14:48:24,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 227 [2023-12-20 14:48:24,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:48:24,240 INFO L225 Difference]: With dead ends: 17862 [2023-12-20 14:48:24,240 INFO L226 Difference]: Without dead ends: 0 [2023-12-20 14:48:24,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 259 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-12-20 14:48:24,257 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 11 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:48:24,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 416 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:48:24,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-20 14:48:24,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-20 14:48:24,257 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-12-20 14:48:24,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-20 14:48:24,258 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 227 [2023-12-20 14:48:24,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:48:24,258 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-20 14:48:24,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-20 14:48:24,258 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-20 14:48:24,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-20 14:48:24,260 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-20 14:48:24,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-20 14:48:24,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-12-20 14:48:24,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2023-12-20 14:48:24,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-20 14:49:38,525 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 926 936) no Hoare annotation was computed. [2023-12-20 14:49:38,525 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 926 936) no Hoare annotation was computed. [2023-12-20 14:49:38,527 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 926 936) the Hoare annotation is: (let ((.cse31 (= |old(~t1_st~0)| ~t1_st~0)) (.cse32 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse17 (< 0 ~t2_pc~0)) (.cse9 (not (= |old(~t2_st~0)| 0))) (.cse30 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0)))) (.cse23 (< |old(~m_st~0)| 2)) (.cse18 (and .cse31 .cse32 (= 0 ~t2_st~0))) (.cse24 (< ~E_1~0 2)) (.cse25 (= ~E_2~0 0)) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse4 (< 0 ~t1_pc~0)) (.cse0 (< ~T1_E~0 2)) (.cse1 (not (= ~q_req_up~0 0))) (.cse3 (not (= ~p_dw_st~0 0))) (.cse5 (not (= ~t2_i~0 1))) (.cse6 (< ~E_2~0 2)) (.cse26 (and .cse31 .cse32 (= |old(~t2_st~0)| ~t2_st~0))) (.cse7 (not (= ~c_dr_pc~0 0))) (.cse8 (not (= ~m_i~0 1))) (.cse29 (< |old(~t1_st~0)| 2)) (.cse22 (not (= ~t1_pc~0 1))) (.cse10 (< ~E_M~0 2)) (.cse11 (not (= ~p_num_write~0 0))) (.cse27 (< |old(~t2_st~0)| 2)) (.cse12 (< 0 ~q_write_ev~0)) (.cse13 (not (= ~p_dw_pc~0 0))) (.cse14 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse15 (not (= ~c_num_read~0 0))) (.cse16 (not (= ~q_free~0 0))) (.cse19 (< ~T2_E~0 2)) (.cse28 (not (= ~t2_pc~0 1))) (.cse20 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse21 (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 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse5 .cse7 .cse8 .cse9 .cse22 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse23 .cse17 .cse18 .cse24 .cse19 .cse20 .cse25) (or .cse0 .cse1 .cse3 .cse5 .cse26 .cse7 .cse8 .cse22 .cse10 .cse11 .cse27 .cse12 .cse13 .cse14 .cse15 .cse16 .cse23 .cse24 .cse19 .cse28 (not (= (+ ~local~0 1) ~token~0)) .cse20 .cse25) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse26 (not (= ~token~0 (+ 2 ~local~0))) .cse7 .cse8 .cse29 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse23 .cse24 .cse19 .cse28 .cse20) (or .cse0 .cse1 .cse3 .cse5 .cse26 .cse7 .cse8 .cse22 .cse10 .cse11 .cse27 .cse30 .cse13 .cse14 .cse15 .cse16 .cse23 .cse24 .cse19 .cse20 .cse25) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse29 .cse22 .cse10 .cse11 .cse12 .cse30 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse26 .cse7 .cse8 .cse22 .cse11 .cse13 .cse14 (= ~m_pc~0 1) .cse15 .cse16 .cse23 .cse24 .cse19 .cse20) (or .cse0 .cse1 .cse3 .cse5 .cse7 .cse8 .cse9 .cse22 .cse10 .cse11 .cse30 .cse13 .cse14 .cse15 .cse16 .cse23 .cse18 .cse24 .cse19 .cse20 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse10 .cse11 .cse27 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse28 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse26 .cse7 .cse8 .cse29 .cse22 .cse10 .cse11 .cse27 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse28 .cse20 .cse21)))) [2023-12-20 14:49:38,528 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 226 240) no Hoare annotation was computed. [2023-12-20 14:49:38,528 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 48 52) no Hoare annotation was computed. [2023-12-20 14:49:38,528 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2023-12-20 14:49:38,528 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 226 240) the Hoare annotation is: (let ((.cse37 (= ~c_dr_pc~0 1)) (.cse40 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse38 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse39 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse41 (= ~q_read_ev~0 2)) (.cse14 (= ~p_dw_st~0 0))) (let ((.cse24 (not .cse14)) (.cse25 (not (= ~c_dr_pc~0 0))) (.cse26 (not (= ~p_num_write~0 0))) (.cse27 (not (= ~p_dw_pc~0 0))) (.cse28 (not (= ~c_num_read~0 0))) (.cse22 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse31 (and .cse38 (= ~q_req_up~0 0) .cse39 .cse41)) (.cse6 (not (= |old(~q_req_up~0)| 1))) (.cse36 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse34 (and .cse38 .cse39 .cse40 .cse41)) (.cse35 (not (= ~q_free~0 0))) (.cse29 (not (= |old(~q_read_ev~0)| 2))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (< 0 ~t1_pc~0)) (.cse3 (< |old(~q_write_ev~0)| 2)) (.cse4 (not (= ~M_E~0 2))) (.cse5 (< ~E_2~0 2)) (.cse7 (and .cse38 .cse39 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse40)) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse32 (= ~m_pc~0 1)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse11 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse12 (< 0 ~t2_pc~0)) (.cse13 (not (= ~E_1~0 ~M_E~0))) (.cse15 (not (= 0 ~t2_st~0))) (.cse16 (not (= ~T1_E~0 ~M_E~0))) (.cse17 (not (= ~m_st~0 0))) (.cse18 (not .cse37)) (.cse19 (< ~T2_E~0 2)) (.cse20 (not (= ~p_dw_i~0 1))) (.cse21 (not (= ~q_free~0 1))) (.cse30 (not (= |old(~q_req_up~0)| 0))) (.cse33 (= ~E_2~0 0)) (.cse23 (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 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse1 .cse24 .cse2 .cse3 .cse4 .cse5 .cse25 .cse8 .cse26 .cse27 .cse9 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20 .cse21 .cse30 .cse22 .cse31 .cse23) (or .cse0 .cse1 .cse24 .cse4 .cse25 .cse8 .cse26 .cse27 .cse9 .cse32 .cse28 .cse13 .cse16 .cse29 .cse20 .cse21 .cse30 .cse22 .cse31 .cse33) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse34 .cse8 .cse9 .cse35 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 (< 0 |old(~q_write_ev~0)|) .cse19 .cse20 .cse30 .cse36 .cse23) (or (and (or .cse0 .cse1 .cse4 .cse8 .cse9 .cse35 .cse13 .cse14 .cse16 .cse29 .cse20 .cse30 .cse33) (or .cse0 .cse1 .cse4 .cse8 .cse9 .cse32 .cse11 .cse13 .cse14 .cse16 .cse29 .cse18 .cse20 .cse21 .cse30 .cse33)) .cse2 .cse3 .cse7 .cse12) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse35 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20 .cse36 .cse23) (or .cse0 .cse1 .cse4 .cse34 .cse8 .cse37 .cse9 .cse32 .cse35 .cse13 .cse16 .cse29 .cse20 .cse33) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse32 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse33 .cse23)))) [2023-12-20 14:49:38,528 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 42 57) no Hoare annotation was computed. [2023-12-20 14:49:38,528 INFO L899 garLoopResultBuilder]: For program point L230-1(lines 226 240) no Hoare annotation was computed. [2023-12-20 14:49:38,528 INFO L899 garLoopResultBuilder]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2023-12-20 14:49:38,528 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 689) no Hoare annotation was computed. [2023-12-20 14:49:38,528 INFO L899 garLoopResultBuilder]: For program point L680-2(lines 680 689) no Hoare annotation was computed. [2023-12-20 14:49:38,528 INFO L899 garLoopResultBuilder]: For program point L643(lines 643 648) no Hoare annotation was computed. [2023-12-20 14:49:38,528 INFO L899 garLoopResultBuilder]: For program point L672(lines 660 674) no Hoare annotation was computed. [2023-12-20 14:49:38,528 INFO L899 garLoopResultBuilder]: For program point L681(lines 681 686) no Hoare annotation was computed. [2023-12-20 14:49:38,528 INFO L899 garLoopResultBuilder]: For program point L661(lines 661 670) no Hoare annotation was computed. [2023-12-20 14:49:38,528 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 921) no Hoare annotation was computed. [2023-12-20 14:49:38,528 INFO L899 garLoopResultBuilder]: For program point L661-2(lines 661 670) no Hoare annotation was computed. [2023-12-20 14:49:38,528 INFO L899 garLoopResultBuilder]: For program point L917-2(lines 892 925) no Hoare annotation was computed. [2023-12-20 14:49:38,529 INFO L899 garLoopResultBuilder]: For program point L653(lines 641 655) no Hoare annotation was computed. [2023-12-20 14:49:38,529 INFO L899 garLoopResultBuilder]: For program point L909(lines 909 913) no Hoare annotation was computed. [2023-12-20 14:49:38,529 INFO L899 garLoopResultBuilder]: For program point L909-2(lines 909 913) no Hoare annotation was computed. [2023-12-20 14:49:38,529 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 892 925) the Hoare annotation is: (let ((.cse34 (= |old(~t1_st~0)| ~t1_st~0)) (.cse36 (= ~m_st~0 |old(~m_st~0)|)) (.cse35 (= |old(~t2_st~0)| ~t2_st~0))) (let ((.cse17 (< 0 ~t2_pc~0)) (.cse24 (= ~m_pc~0 1)) (.cse33 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0)))) (.cse28 (= ~E_2~0 0)) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse31 (not (= ~token~0 (+ 2 ~local~0)))) (.cse4 (< 0 ~t1_pc~0)) (.cse22 (and .cse34 .cse36 .cse35)) (.cse23 (< |old(~t2_st~0)| 2)) (.cse21 (not (= ~token~0 ~local~0))) (.cse0 (< ~T1_E~0 2)) (.cse1 (not (= ~q_req_up~0 0))) (.cse3 (not (= ~p_dw_st~0 0))) (.cse5 (not (= ~t2_i~0 1))) (.cse6 (< ~E_2~0 2)) (.cse7 (not (= ~c_dr_pc~0 0))) (.cse8 (not (= ~m_i~0 1))) (.cse9 (not (= |old(~t2_st~0)| 0))) (.cse32 (< |old(~t1_st~0)| 2)) (.cse27 (not (= ~t1_pc~0 1))) (.cse10 (< ~E_M~0 2)) (.cse11 (not (= ~p_num_write~0 0))) (.cse12 (< 0 ~q_write_ev~0)) (.cse13 (not (= ~p_dw_pc~0 0))) (.cse14 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse15 (not (= ~c_num_read~0 0))) (.cse16 (not (= ~q_free~0 0))) (.cse25 (< |old(~m_st~0)| 2)) (.cse18 (and .cse34 .cse36 (= 0 ~t2_st~0))) (.cse26 (< ~E_1~0 2)) (.cse19 (< ~T2_E~0 2)) (.cse29 (not (= ~t2_pc~0 1))) (.cse30 (not (= (+ ~local~0 1) ~token~0))) (.cse20 (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 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse22 .cse7 .cse8 .cse10 .cse11 .cse23 .cse13 .cse14 .cse24 .cse15 .cse16 .cse25 .cse26 .cse19 .cse20) (or .cse0 .cse1 .cse3 .cse5 .cse7 .cse8 .cse9 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse25 .cse17 .cse18 .cse26 .cse19 .cse20 .cse28) (or .cse0 .cse1 .cse3 .cse5 .cse22 .cse7 .cse8 .cse27 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse25 .cse26 .cse19 .cse29 .cse30 .cse20 .cse28) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse22 .cse31 .cse7 .cse8 .cse32 .cse27 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse25 .cse26 .cse19 .cse29 .cse20) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse22 .cse7 .cse8 .cse32 .cse27 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse25 .cse26 .cse19 .cse29 .cse20) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse22 .cse7 .cse8 .cse27 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse25 .cse26 .cse19 .cse29 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse5 .cse22 .cse7 .cse8 .cse27 .cse10 .cse11 .cse23 .cse33 .cse13 .cse14 .cse15 .cse16 .cse25 .cse26 .cse19 .cse20 .cse28) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse32 .cse27 .cse10 .cse11 .cse12 .cse33 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse25 .cse17 .cse18 .cse26 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse24 .cse15 .cse16 .cse25 .cse17 .cse18 .cse26 .cse19 .cse20) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse22 .cse7 .cse8 .cse27 .cse11 .cse13 .cse14 .cse24 .cse15 .cse16 .cse25 .cse26 .cse19 .cse20) (or .cse0 .cse1 .cse3 .cse5 .cse7 .cse8 .cse9 .cse27 .cse10 .cse11 .cse33 .cse13 .cse14 .cse15 .cse16 .cse25 .cse18 .cse26 .cse19 .cse20 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse7 .cse8 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse29 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse22 .cse7 .cse8 .cse32 .cse27 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse29 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse5 (and .cse34 (= ~m_st~0 0) .cse35) .cse6 .cse31 .cse7 .cse8 .cse32 .cse27 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= |old(~m_st~0)| 0)) .cse26 .cse19 .cse29 .cse20) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse22 .cse7 .cse8 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse25 .cse26 .cse19 .cse29 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse32 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse25 .cse18 .cse26 .cse19 .cse29 .cse30 .cse20)))) [2023-12-20 14:49:38,529 INFO L899 garLoopResultBuilder]: For program point L901(lines 901 905) no Hoare annotation was computed. [2023-12-20 14:49:38,529 INFO L899 garLoopResultBuilder]: For program point L901-2(lines 901 905) no Hoare annotation was computed. [2023-12-20 14:49:38,529 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 892 925) no Hoare annotation was computed. [2023-12-20 14:49:38,529 INFO L899 garLoopResultBuilder]: For program point L662(lines 662 667) no Hoare annotation was computed. [2023-12-20 14:49:38,529 INFO L899 garLoopResultBuilder]: For program point L691(lines 679 693) no Hoare annotation was computed. [2023-12-20 14:49:38,529 INFO L899 garLoopResultBuilder]: For program point L642(lines 642 651) no Hoare annotation was computed. [2023-12-20 14:49:38,529 INFO L895 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (let ((.cse31 (= ~c_dr_pc~0 1)) (.cse22 (= |old(~p_dw_st~0)| 0)) (.cse35 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse3 (not (= ~c_dr_pc~0 0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse12 (and .cse35 (= ~p_dw_st~0 0))) (.cse16 (not .cse22)) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse24 (not (= ~q_free~0 0))) (.cse17 (not (= ~q_read_ev~0 2))) (.cse0 (not (= ~q_req_up~0 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse20 (< 0 ~t1_pc~0)) (.cse2 (not (= ~M_E~0 2))) (.cse21 (< ~E_2~0 2)) (.cse23 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse35)) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (= ~m_pc~0 1)) (.cse25 (not (= ~p_dw_pc~0 1))) (.cse33 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse26 (< 0 ~t2_pc~0)) (.cse10 (not (= ~E_1~0 ~M_E~0))) (.cse27 (not (= 0 ~t2_st~0))) (.cse11 (not (= ~T1_E~0 ~M_E~0))) (.cse28 (not (= ~m_st~0 0))) (.cse34 (not .cse31)) (.cse29 (< ~T2_E~0 2)) (.cse13 (not (= ~p_dw_i~0 1))) (.cse14 (not (= ~q_free~0 1))) (.cse15 (= |old(~c_dr_st~0)| 0)) (.cse32 (< ~q_write_ev~0 2)) (.cse19 (= ~E_2~0 0)) (.cse30 (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 .cse19) (or .cse0 .cse1 .cse20 .cse2 .cse21 .cse22 .cse23 .cse4 .cse7 .cse24 .cse25 .cse26 .cse10 .cse27 .cse11 .cse28 .cse29 .cse13 .cse15 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse17 .cse30) (or .cse1 .cse2 .cse23 .cse4 .cse31 .cse7 .cse8 .cse24 .cse10 .cse11 .cse13 .cse15 .cse17 .cse19) (or .cse0 .cse1 .cse20 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse27 .cse11 .cse28 .cse12 .cse29 .cse13 .cse14 .cse16 .cse32 .cse17 .cse18 .cse30) (or .cse20 .cse23 .cse26 (and (or .cse0 .cse1 .cse2 .cse22 .cse4 .cse7 .cse8 .cse33 .cse10 .cse11 .cse34 .cse13 .cse14 .cse15 .cse17 .cse19) (or .cse0 .cse1 .cse2 .cse22 .cse4 .cse7 .cse24 .cse10 .cse11 .cse13 .cse15 .cse17 .cse19)) .cse32) (or .cse0 .cse1 .cse20 .cse2 .cse21 .cse22 .cse23 .cse4 .cse7 .cse8 .cse25 .cse33 .cse26 .cse10 .cse27 .cse11 .cse28 .cse34 .cse29 .cse13 .cse14 .cse15 .cse32 .cse19 .cse30)))) [2023-12-20 14:49:38,530 INFO L895 garLoopResultBuilder]: At program point L323-2(lines 323 327) the Hoare annotation is: (let ((.cse24 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse23 (= |old(~p_dw_st~0)| 0)) (.cse38 (= activate_threads1_~tmp~1 0)) (.cse25 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse20 (= ~p_dw_st~0 0)) (.cse37 (= ~c_dr_pc~0 1))) (let ((.cse27 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse31 (not .cse37)) (.cse26 (not (= ~p_dw_pc~0 1))) (.cse0 (not (= ~q_req_up~0 0))) (.cse21 (< 0 ~t1_pc~0)) (.cse22 (< ~E_2~0 2)) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (and .cse38 .cse25 .cse20)) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse28 (< 0 ~t2_pc~0)) (.cse29 (not (= 0 ~t2_st~0))) (.cse30 (not (= ~m_st~0 0))) (.cse32 (< ~T2_E~0 2)) (.cse14 (not (= ~q_free~0 1))) (.cse16 (not .cse23)) (.cse33 (< ~q_write_ev~0 2)) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse34 (not (= ~token~0 ~local~0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~M_E~0 2))) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (= ~m_pc~0 1)) (.cse36 (not (= ~q_free~0 0))) (.cse11 (not (= ~E_1~0 ~M_E~0))) (.cse12 (not (= ~T1_E~0 ~M_E~0))) (.cse35 (and .cse24 .cse38 .cse25)) (.cse13 (not (= ~p_dw_i~0 1))) (.cse15 (= |old(~c_dr_st~0)| 0)) (.cse17 (not (= ~q_read_ev~0 2))) (.cse19 (= ~E_2~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 (and (= ~q_read_ev~0 1) (not (= ~c_dr_st~0 0)) .cse20) .cse21 .cse2 .cse22 .cse23 (and .cse24 .cse25) .cse4 .cse8 .cse9 .cse26 .cse27 .cse28 .cse11 .cse29 .cse12 .cse30 .cse31 .cse32 .cse13 .cse14 .cse15 .cse33 .cse19 .cse34) (or .cse21 .cse28 .cse35 (and (or .cse0 .cse1 .cse2 .cse23 .cse4 .cse8 .cse9 .cse27 .cse11 .cse12 .cse31 .cse13 .cse14 .cse15 .cse17 .cse19) (or .cse0 .cse1 .cse2 .cse23 .cse4 .cse8 .cse36 .cse11 .cse12 .cse13 .cse15 .cse17 .cse19)) .cse33) (or .cse0 .cse1 .cse21 .cse2 .cse22 .cse23 .cse4 .cse8 .cse36 .cse26 .cse28 .cse11 .cse29 .cse12 .cse30 .cse35 .cse32 .cse13 .cse15 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse17 .cse34) (or .cse0 .cse1 .cse21 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse28 .cse11 .cse29 .cse12 .cse30 .cse32 .cse13 .cse14 .cse16 .cse33 .cse17 .cse18 .cse34) (or .cse1 .cse2 .cse4 .cse37 .cse8 .cse9 .cse36 .cse11 .cse12 .cse35 .cse13 .cse15 .cse17 .cse19)))) [2023-12-20 14:49:38,530 INFO L899 garLoopResultBuilder]: For program point L321-1(line 321) no Hoare annotation was computed. [2023-12-20 14:49:38,530 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 315 339) no Hoare annotation was computed. [2023-12-20 14:49:38,530 INFO L899 garLoopResultBuilder]: For program point L331(lines 331 335) no Hoare annotation was computed. [2023-12-20 14:49:38,530 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 315 339) the Hoare annotation is: (let ((.cse31 (= ~c_dr_pc~0 1)) (.cse22 (= |old(~p_dw_st~0)| 0)) (.cse35 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse3 (not (= ~c_dr_pc~0 0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse12 (and .cse35 (= ~p_dw_st~0 0))) (.cse16 (not .cse22)) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse24 (not (= ~q_free~0 0))) (.cse17 (not (= ~q_read_ev~0 2))) (.cse0 (not (= ~q_req_up~0 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse20 (< 0 ~t1_pc~0)) (.cse2 (not (= ~M_E~0 2))) (.cse21 (< ~E_2~0 2)) (.cse23 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse35)) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (= ~m_pc~0 1)) (.cse25 (not (= ~p_dw_pc~0 1))) (.cse33 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse26 (< 0 ~t2_pc~0)) (.cse10 (not (= ~E_1~0 ~M_E~0))) (.cse27 (not (= 0 ~t2_st~0))) (.cse11 (not (= ~T1_E~0 ~M_E~0))) (.cse28 (not (= ~m_st~0 0))) (.cse34 (not .cse31)) (.cse29 (< ~T2_E~0 2)) (.cse13 (not (= ~p_dw_i~0 1))) (.cse14 (not (= ~q_free~0 1))) (.cse15 (= |old(~c_dr_st~0)| 0)) (.cse32 (< ~q_write_ev~0 2)) (.cse19 (= ~E_2~0 0)) (.cse30 (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 .cse19) (or .cse0 .cse1 .cse20 .cse2 .cse21 .cse22 .cse23 .cse4 .cse7 .cse24 .cse25 .cse26 .cse10 .cse27 .cse11 .cse28 .cse29 .cse13 .cse15 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse17 .cse30) (or .cse1 .cse2 .cse23 .cse4 .cse31 .cse7 .cse8 .cse24 .cse10 .cse11 .cse13 .cse15 .cse17 .cse19) (or .cse0 .cse1 .cse20 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse27 .cse11 .cse28 .cse12 .cse29 .cse13 .cse14 .cse16 .cse32 .cse17 .cse18 .cse30) (or .cse20 .cse23 .cse26 (and (or .cse0 .cse1 .cse2 .cse22 .cse4 .cse7 .cse8 .cse33 .cse10 .cse11 .cse34 .cse13 .cse14 .cse15 .cse17 .cse19) (or .cse0 .cse1 .cse2 .cse22 .cse4 .cse7 .cse24 .cse10 .cse11 .cse13 .cse15 .cse17 .cse19)) .cse32) (or .cse0 .cse1 .cse20 .cse2 .cse21 .cse22 .cse23 .cse4 .cse7 .cse8 .cse25 .cse33 .cse26 .cse10 .cse27 .cse11 .cse28 .cse34 .cse29 .cse13 .cse14 .cse15 .cse32 .cse19 .cse30)))) [2023-12-20 14:49:38,530 INFO L899 garLoopResultBuilder]: For program point L329(line 329) no Hoare annotation was computed. [2023-12-20 14:49:38,530 INFO L899 garLoopResultBuilder]: For program point L331-2(lines 315 339) no Hoare annotation was computed. [2023-12-20 14:49:38,530 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2023-12-20 14:49:38,530 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 695 702) no Hoare annotation was computed. [2023-12-20 14:49:38,530 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 695 702) the Hoare annotation is: true [2023-12-20 14:49:38,530 INFO L899 garLoopResultBuilder]: For program point L830-1(lines 819 852) no Hoare annotation was computed. [2023-12-20 14:49:38,530 INFO L899 garLoopResultBuilder]: For program point L820-1(lines 819 852) no Hoare annotation was computed. [2023-12-20 14:49:38,530 INFO L899 garLoopResultBuilder]: For program point L845-1(lines 816 853) no Hoare annotation was computed. [2023-12-20 14:49:38,531 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 816 853) the Hoare annotation is: (let ((.cse6 (< ~m_st~0 2)) (.cse24 (= ~m_pc~0 1)) (.cse29 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (< 0 ~t1_pc~0)) (.cse26 (not (= ~t2_pc~0 1))) (.cse27 (< ~t2_st~0 2)) (.cse0 (not (= ~q_req_up~0 0))) (.cse25 (< ~t1_st~0 2)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~t2_i~0 1))) (.cse4 (not (= ~c_dr_pc~0 0))) (.cse5 (not (= ~m_i~0 1))) (.cse23 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (< 0 ~q_write_ev~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(~E_1~0)| 2)) (.cse14 (< |old(~E_M~0)| 2)) (.cse15 (< 0 ~t2_pc~0)) (.cse16 (not (= 0 ~t2_st~0))) (.cse17 (< |old(~T2_E~0)| 2)) (.cse30 (not (= ~m_st~0 0))) (.cse18 (< |old(~E_2~0)| 2)) (.cse19 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse20 (< |old(~T1_E~0)| 2)) (.cse28 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2))) (.cse21 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))) (.cse22 (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 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse25 .cse1 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse26 (not (= (+ ~local~0 1) ~token~0)) .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse27 .cse19 .cse20 .cse28 .cse21) (or .cse0 .cse29 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse25 .cse1 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse26 .cse27 .cse19 .cse20 .cse21) (or .cse0 .cse25 .cse1 .cse3 (not (= ~token~0 (+ 2 ~local~0))) .cse4 .cse5 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse30 .cse18 .cse26 .cse27 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse26 .cse27 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse27 .cse19 .cse20 .cse21) (or .cse0 .cse25 .cse1 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse26 .cse27 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse25 .cse1 .cse3 .cse4 .cse5 .cse23 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse17 .cse30 .cse18 .cse26 .cse27 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse29 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse30 .cse18 .cse26 .cse27 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse25 .cse1 .cse3 .cse4 .cse5 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse28 .cse21 .cse22))) [2023-12-20 14:49:38,531 INFO L899 garLoopResultBuilder]: For program point L835-1(lines 819 852) no Hoare annotation was computed. [2023-12-20 14:49:38,531 INFO L899 garLoopResultBuilder]: For program point L825-1(lines 819 852) no Hoare annotation was computed. [2023-12-20 14:49:38,531 INFO L899 garLoopResultBuilder]: For program point L840-1(lines 819 852) no Hoare annotation was computed. [2023-12-20 14:49:38,531 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 816 853) no Hoare annotation was computed. [2023-12-20 14:49:38,531 INFO L899 garLoopResultBuilder]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2023-12-20 14:49:38,531 INFO L899 garLoopResultBuilder]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2023-12-20 14:49:38,531 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 279 296) the Hoare annotation is: (let ((.cse23 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse34 (= ~c_dr_pc~0 1)) (.cse27 (= ~p_dw_st~0 0))) (let ((.cse3 (not .cse27)) (.cse5 (not (= ~c_dr_pc~0 0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse11 (not (= ~c_num_read~0 0))) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse22 (< ~E_2~0 2)) (.cse24 (not (= ~p_dw_pc~0 1))) (.cse28 (not (= 0 ~t2_st~0))) (.cse29 (not (= ~m_st~0 0))) (.cse31 (< ~T2_E~0 2)) (.cse32 (not (= ~token~0 ~local~0))) (.cse20 (< 0 ~t1_pc~0)) (.cse21 (< |old(~q_write_ev~0)| 2)) (.cse26 (< 0 ~t2_pc~0)) (.cse25 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse30 (not .cse34)) (.cse16 (not (= ~q_free~0 1))) (.cse1 (not (= ~q_req_up~0 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse4 (not (= ~M_E~0 2))) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (= ~m_pc~0 1)) (.cse33 (not (= ~q_free~0 0))) (.cse12 (not (= ~E_1~0 ~M_E~0))) (.cse13 (not (= ~T1_E~0 ~M_E~0))) (.cse14 (not (= |old(~q_read_ev~0)| 2))) (.cse15 (not (= ~p_dw_i~0 1))) (.cse18 (and .cse23 (= ~q_read_ev~0 2))) (.cse19 (= ~E_2~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse20 .cse21 .cse4 .cse22 .cse6 .cse9 .cse10 (and .cse23 (= |old(~q_read_ev~0)| ~q_read_ev~0)) .cse24 .cse25 .cse26 .cse12 .cse27 .cse28 .cse13 .cse29 .cse30 .cse31 .cse15 .cse16 .cse19 .cse32) (or .cse1 .cse2 .cse3 .cse20 .cse21 .cse4 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse26 .cse12 .cse28 .cse13 .cse29 .cse14 .cse31 .cse15 .cse16 .cse17 .cse18 .cse32) (or .cse0 .cse1 .cse2 .cse20 .cse4 .cse22 .cse6 .cse9 .cse33 .cse24 .cse26 .cse12 .cse27 .cse28 .cse13 .cse29 .cse14 (< 0 |old(~q_write_ev~0)|) .cse31 .cse15 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse18 .cse32) (or .cse20 .cse21 .cse26 (and (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse9 .cse10 .cse25 .cse12 .cse27 .cse13 .cse14 .cse30 .cse15 .cse16 .cse19) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse9 .cse33 .cse12 .cse27 .cse13 .cse14 .cse15 .cse19)) .cse18) (or .cse0 .cse2 .cse4 .cse6 .cse34 .cse9 .cse10 .cse33 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19)))) [2023-12-20 14:49:38,531 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 279 296) no Hoare annotation was computed. [2023-12-20 14:49:38,531 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2023-12-20 14:49:38,531 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 101) no Hoare annotation was computed. [2023-12-20 14:49:38,531 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 101) no Hoare annotation was computed. [2023-12-20 14:49:38,531 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 88 106) the Hoare annotation is: true [2023-12-20 14:49:38,531 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 88 106) no Hoare annotation was computed. [2023-12-20 14:49:38,531 INFO L899 garLoopResultBuilder]: For program point L103(lines 91 105) no Hoare annotation was computed. [2023-12-20 14:49:38,531 INFO L899 garLoopResultBuilder]: For program point L960-1(lines 949 982) no Hoare annotation was computed. [2023-12-20 14:49:38,531 INFO L899 garLoopResultBuilder]: For program point L762(lines 762 766) no Hoare annotation was computed. [2023-12-20 14:49:38,532 INFO L895 garLoopResultBuilder]: At program point L795-1(lines 757 809) the Hoare annotation is: (let ((.cse16 (= ~t2_pc~0 1)) (.cse24 (<= 2 ~m_st~0)) (.cse23 (<= 2 ~t2_st~0)) (.cse28 (= ~m_pc~0 ~t1_pc~0)) (.cse27 (<= ~t1_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (<= ~q_write_ev~0 0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~E_M~0)) (.cse10 (= ~m_st~0 0)) (.cse11 (not (= ~m_pc~0 1))) (.cse12 (= ~q_free~0 0)) (.cse13 (= ~q_req_up~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 2 ~E_2~0)) (.cse17 (= ~m_i~0 1)) (.cse18 (= ~p_dw_st~0 0)) (.cse19 (= ~t2_i~0 1)) (.cse20 (= ~c_dr_pc~0 0)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (= 0 ~t2_st~0)) (.cse22 (= ~token~0 ~local~0)) (.cse26 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~token~0 (+ 2 ~local~0)) .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (+ ~local~0 1) ~token~0) .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse26) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26))) [2023-12-20 14:49:38,532 INFO L899 garLoopResultBuilder]: For program point L762-1(lines 757 809) no Hoare annotation was computed. [2023-12-20 14:49:38,532 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 132 171) no Hoare annotation was computed. [2023-12-20 14:49:38,532 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse24 (= ~p_dw_st~0 0))) (let ((.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~q_free~0 1)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse0 (<= 2 ~T2_E~0)) (.cse25 (not .cse24)) (.cse27 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse5 (= ~m_st~0 0)) (.cse10 (<= ~t1_pc~0 0)) (.cse11 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~E_2~0)) (.cse14 (= ~p_dw_pc~0 1)) (.cse18 (= 0 ~t2_st~0)) (.cse19 (= ~token~0 ~local~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse7 (not (= ~m_pc~0 1))) (.cse9 (not (= ~c_dr_st~0 0))) (.cse26 (= ~q_free~0 0)) (.cse23 (not (= ~E_2~0 0))) (.cse15 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_pc~0 1)) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (= ~E_M~0 2)) (.cse20 (= ~E_1~0 2)) (.cse21 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse11 .cse23 .cse24 .cse15 (= ~c_dr_pc~0 0) .cse16 (= ~c_last_read~0 ~p_last_write~0) .cse17 .cse20 .cse21) (and .cse8 (or (and .cse25 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse11 .cse23 .cse12 .cse15 .cse16 .cse17 .cse20 .cse21) (and .cse25 .cse2 .cse3 .cse4 .cse9 .cse26 .cse11 .cse23 .cse15 .cse16 .cse17 .cse20 .cse21)) .cse10 .cse22) (and .cse0 .cse25 .cse2 .cse27 .cse3 .cse4 .cse5 .cse8 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse25 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse25 (<= ~q_write_ev~0 0) .cse2 .cse27 .cse3 .cse4 .cse5 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse4 .cse7 .cse9 .cse26 .cse23 .cse15 (not .cse12) .cse16 .cse17 .cse20 .cse21)))) [2023-12-20 14:49:38,532 INFO L899 garLoopResultBuilder]: For program point L400-1(line 400) no Hoare annotation was computed. [2023-12-20 14:49:38,532 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 144) no Hoare annotation was computed. [2023-12-20 14:49:38,532 INFO L899 garLoopResultBuilder]: For program point L1061(lines 1061 1065) no Hoare annotation was computed. [2023-12-20 14:49:38,537 INFO L895 garLoopResultBuilder]: At program point L1029-1(lines 1029 1066) the Hoare annotation is: (let ((.cse16 (= ~t2_pc~0 1)) (.cse24 (<= 2 ~m_st~0)) (.cse23 (<= 2 ~t2_st~0)) (.cse28 (= ~m_pc~0 ~t1_pc~0)) (.cse27 (<= ~t1_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (<= ~q_write_ev~0 0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~E_M~0)) (.cse10 (= ~m_st~0 0)) (.cse11 (not (= ~m_pc~0 1))) (.cse12 (= ~q_free~0 0)) (.cse13 (= ~q_req_up~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 2 ~E_2~0)) (.cse17 (= ~m_i~0 1)) (.cse18 (= ~p_dw_st~0 0)) (.cse19 (= ~t2_i~0 1)) (.cse20 (= ~c_dr_pc~0 0)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (= 0 ~t2_st~0)) (.cse22 (= ~token~0 ~local~0)) (.cse26 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~token~0 (+ 2 ~local~0)) .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (+ ~local~0 1) ~token~0) .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse26) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26))) [2023-12-20 14:49:38,537 INFO L899 garLoopResultBuilder]: For program point L798(lines 798 805) no Hoare annotation was computed. [2023-12-20 14:49:38,537 INFO L899 garLoopResultBuilder]: For program point L798-2(lines 798 805) no Hoare annotation was computed. [2023-12-20 14:49:38,537 INFO L895 garLoopResultBuilder]: At program point L435(line 435) the Hoare annotation is: (let ((.cse8 (= ~p_dw_st~0 0))) (let ((.cse15 (= ~q_req_up~0 1)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (= ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ~q_free~0 1)) (.cse27 (<= 2 ~q_write_ev~0)) (.cse4 (not (= ~m_pc~0 1))) (.cse7 (not (= ~E_2~0 0))) (.cse29 (= ~c_dr_pc~0 1)) (.cse16 (<= 2 ~T2_E~0)) (.cse17 (not .cse8)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse19 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse20 (= ~q_free~0 0)) (.cse21 (<= ~t1_pc~0 0)) (.cse6 (= ~q_req_up~0 0)) (.cse22 (<= 2 ~E_2~0)) (.cse23 (= ~p_dw_pc~0 1)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~p_dw_i~0 1)) (.cse12 (= ~E_M~0 2)) (.cse24 (= 0 ~t2_st~0)) (.cse25 (= ~token~0 ~local~0)) (.cse13 (= ~E_1~0 2)) (.cse14 (= ~M_E~0 2)) (.cse26 (<= ~t2_pc~0 0))) (or (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~c_dr_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse0 .cse18 .cse1 .cse2 .cse19 .cse5 .cse20 .cse21 .cse22 .cse23 .cse9 .cse10 .cse12 .cse24 .cse25 .cse13 .cse14 .cse26) (and .cse27 (or (and .cse17 .cse28 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse17 .cse0 .cse1 .cse2 .cse5 .cse20 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14)) .cse21 .cse26) (and .cse15 .cse16 .cse17 .cse28 .cse0 .cse1 .cse2 .cse19 .cse3 .cse27 .cse5 .cse21 .cse29 .cse22 .cse23 .cse10 .cse11 .cse12 .cse24 .cse25 .cse13 .cse14 .cse26) (and .cse16 .cse17 .cse28 .cse0 .cse1 .cse2 .cse19 .cse3 .cse27 .cse5 .cse21 .cse6 .cse29 .cse22 .cse23 .cse10 .cse12 .cse24 .cse25 .cse13 .cse14 .cse26) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse20 .cse7 .cse9 (not .cse29) .cse10 .cse12 .cse13 .cse14) (and .cse16 .cse17 (<= ~q_write_ev~0 0) .cse0 .cse18 .cse1 .cse2 .cse19 .cse5 .cse20 .cse21 .cse6 .cse22 .cse23 .cse9 .cse10 .cse12 .cse24 .cse25 .cse13 .cse14 .cse26)))) [2023-12-20 14:49:38,538 INFO L899 garLoopResultBuilder]: For program point L435-1(line 435) no Hoare annotation was computed. [2023-12-20 14:49:38,538 INFO L899 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2023-12-20 14:49:38,538 INFO L899 garLoopResultBuilder]: For program point transmit1_returnLabel#1(lines 566 601) no Hoare annotation was computed. [2023-12-20 14:49:38,538 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 143) no Hoare annotation was computed. [2023-12-20 14:49:38,538 INFO L899 garLoopResultBuilder]: For program point L965-1(lines 949 982) no Hoare annotation was computed. [2023-12-20 14:49:38,538 INFO L899 garLoopResultBuilder]: For program point L767-1(lines 757 809) no Hoare annotation was computed. [2023-12-20 14:49:38,538 INFO L899 garLoopResultBuilder]: For program point start_simulation2_returnLabel#1(lines 1014 1072) no Hoare annotation was computed. [2023-12-20 14:49:38,538 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 218) no Hoare annotation was computed. [2023-12-20 14:49:38,538 INFO L899 garLoopResultBuilder]: For program point master_returnLabel#1(lines 522 565) no Hoare annotation was computed. [2023-12-20 14:49:38,538 INFO L899 garLoopResultBuilder]: For program point L570(lines 570 578) no Hoare annotation was computed. [2023-12-20 14:49:38,538 INFO L895 garLoopResultBuilder]: At program point L372(lines 347 387) the Hoare annotation is: (let ((.cse12 (= ~c_dr_pc~0 1)) (.cse27 (= ~p_dw_st~0 0))) (let ((.cse24 (= ~p_num_write~0 0)) (.cse28 (= ~c_dr_pc~0 0)) (.cse25 (= ~c_num_read~0 0)) (.cse23 (= ~p_dw_pc~0 0)) (.cse32 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse11 (= ~q_req_up~0 0)) (.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~q_free~0 1)) (.cse29 (= ~c_last_read~0 ~p_last_write~0)) (.cse30 (= ~q_req_up~0 1)) (.cse0 (<= 2 ~T2_E~0)) (.cse31 (not .cse27)) (.cse35 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse5 (= ~m_st~0 0)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~E_2~0)) (.cse14 (= ~p_dw_pc~0 1)) (.cse18 (= 0 ~t2_st~0)) (.cse19 (= ~token~0 ~local~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse7 (not (= ~m_pc~0 1))) (.cse9 (not (= ~c_dr_st~0 0))) (.cse33 (= ~q_free~0 0)) (.cse26 (not (= ~E_2~0 0))) (.cse15 (= ~q_read_ev~0 2)) (.cse34 (not .cse12)) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (= ~E_M~0 2)) (.cse20 (= ~E_1~0 2)) (.cse21 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse24 .cse25 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse11 .cse26 .cse27 .cse15 .cse28 .cse16 .cse29 .cse17 .cse20 .cse21) (and .cse23 .cse0 .cse24 .cse25 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse13 .cse27 .cse15 .cse28 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse30 .cse0 .cse31 .cse25 .cse2 .cse3 .cse4 .cse32 .cse5 .cse8 .cse33 .cse10 .cse13 .cse14 .cse15 .cse34 .cse16 (= ~p_num_write~0 1) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse31 (<= ~q_write_ev~0 0) .cse2 .cse35 .cse3 .cse4 .cse5 .cse7 .cse9 .cse33 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse8 (or (and .cse31 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse11 .cse26 .cse12 .cse15 .cse16 .cse17 .cse20 .cse21) (and .cse31 .cse2 .cse3 .cse4 .cse9 .cse33 .cse11 .cse26 .cse15 .cse16 .cse17 .cse20 .cse21)) .cse10 .cse22) (and .cse0 .cse31 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse32 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse31 .cse2 .cse35 .cse3 .cse4 .cse5 .cse7 .cse8 .cse33 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse30 .cse0 .cse31 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse30 .cse0 .cse31 .cse2 .cse35 .cse3 .cse4 .cse5 .cse8 .cse9 .cse33 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse4 .cse7 .cse9 .cse33 .cse26 .cse15 .cse34 .cse16 .cse17 .cse20 .cse21)))) [2023-12-20 14:49:38,538 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2023-12-20 14:49:38,538 INFO L895 garLoopResultBuilder]: At program point L439(line 439) the Hoare annotation is: (let ((.cse8 (= ~p_dw_st~0 0))) (let ((.cse16 (= ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ~q_free~0 1)) (.cse14 (<= 2 ~q_write_ev~0)) (.cse4 (not (= ~m_pc~0 1))) (.cse7 (not (= ~E_2~0 0))) (.cse17 (= ~c_dr_pc~0 1)) (.cse21 (<= 2 ~T2_E~0)) (.cse15 (not .cse8)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse22 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse18 (= ~q_free~0 0)) (.cse19 (<= ~t1_pc~0 0)) (.cse6 (= ~q_req_up~0 0)) (.cse23 (<= 2 ~E_2~0)) (.cse24 (= ~p_dw_pc~0 1)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~p_dw_i~0 1)) (.cse11 (= ~E_M~0 2)) (.cse25 (= 0 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse12 (= ~E_1~0 2)) (.cse13 (= ~M_E~0 2)) (.cse20 (<= ~t2_pc~0 0))) (or (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~c_dr_pc~0 0) .cse10 (= ~c_last_read~0 ~p_last_write~0) .cse11 .cse12 .cse13) (and .cse14 (or (and .cse15 .cse16 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse0 .cse1 .cse2 .cse5 .cse18 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13)) .cse19 .cse20) (and .cse21 .cse15 .cse16 .cse0 .cse1 .cse2 .cse22 .cse3 .cse14 .cse5 .cse19 .cse6 .cse17 .cse23 .cse24 .cse10 .cse11 .cse25 .cse26 .cse12 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse18 .cse7 .cse9 (not .cse17) .cse10 .cse11 .cse12 .cse13) (and .cse21 .cse15 (<= ~q_write_ev~0 0) .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2 .cse22 .cse5 .cse18 .cse19 .cse6 .cse23 .cse24 .cse9 .cse10 .cse11 .cse25 .cse26 .cse12 .cse13 .cse20)))) [2023-12-20 14:49:38,538 INFO L895 garLoopResultBuilder]: At program point L439-1(line 439) the Hoare annotation is: (let ((.cse8 (= ~p_dw_st~0 0))) (let ((.cse21 (<= 2 ~T2_E~0)) (.cse15 (not .cse8)) (.cse16 (= ~c_num_read~0 ~p_num_write~0)) (.cse22 (= ~m_st~0 0)) (.cse3 (= ~q_free~0 1)) (.cse14 (<= 2 ~q_write_ev~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse6 (= ~q_req_up~0 0)) (.cse23 (<= 2 ~E_2~0)) (.cse24 (= ~p_dw_pc~0 1)) (.cse25 (= 0 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse20 (<= ~t2_pc~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse4 (not (= ~m_pc~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse18 (= ~q_free~0 0)) (.cse7 (not (= ~E_2~0 0))) (.cse9 (= ~q_read_ev~0 2)) (.cse17 (= ~c_dr_pc~0 1)) (.cse10 (= ~p_dw_i~0 1)) (.cse11 (= ~E_M~0 2)) (.cse12 (= ~E_1~0 2)) (.cse13 (= ~M_E~0 2))) (or (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~c_dr_pc~0 0) .cse10 (= ~c_last_read~0 ~p_last_write~0) .cse11 .cse12 .cse13) (and .cse14 (or (and .cse15 .cse16 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse0 .cse1 .cse2 .cse5 .cse18 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13)) .cse19 .cse20) (and .cse21 .cse15 .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2 .cse22 .cse5 .cse18 .cse19 .cse6 .cse23 .cse24 .cse9 .cse10 .cse11 .cse25 .cse26 .cse12 .cse13 .cse20) (and .cse21 .cse15 .cse16 .cse0 .cse1 .cse2 .cse22 .cse3 .cse14 .cse5 .cse19 .cse6 .cse17 .cse23 .cse24 .cse10 .cse11 .cse25 .cse26 .cse12 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse18 .cse7 .cse9 (not .cse17) .cse10 .cse11 .cse12 .cse13)))) [2023-12-20 14:49:38,539 INFO L899 garLoopResultBuilder]: For program point start_simulation1_returnLabel#1(lines 413 455) no Hoare annotation was computed. [2023-12-20 14:49:38,539 INFO L895 garLoopResultBuilder]: At program point L1001(line 1001) the Hoare annotation is: (let ((.cse16 (= ~t2_pc~0 1)) (.cse24 (<= 2 ~m_st~0)) (.cse23 (<= 2 ~t2_st~0)) (.cse28 (= ~m_pc~0 ~t1_pc~0)) (.cse27 (<= ~t1_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (<= ~q_write_ev~0 0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~E_M~0)) (.cse10 (= ~m_st~0 0)) (.cse11 (not (= ~m_pc~0 1))) (.cse12 (= ~q_free~0 0)) (.cse13 (= ~q_req_up~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 2 ~E_2~0)) (.cse17 (= ~m_i~0 1)) (.cse18 (= ~p_dw_st~0 0)) (.cse19 (= ~t2_i~0 1)) (.cse20 (= ~c_dr_pc~0 0)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (= 0 ~t2_st~0)) (.cse22 (= ~token~0 ~local~0)) (.cse26 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~token~0 (+ 2 ~local~0)) .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (+ ~local~0 1) ~token~0) .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse26) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26))) [2023-12-20 14:49:38,539 INFO L899 garLoopResultBuilder]: For program point L1001-1(line 1001) no Hoare annotation was computed. [2023-12-20 14:49:38,539 INFO L899 garLoopResultBuilder]: For program point L770(lines 770 777) no Hoare annotation was computed. [2023-12-20 14:49:38,539 INFO L899 garLoopResultBuilder]: For program point L770-2(lines 770 777) no Hoare annotation was computed. [2023-12-20 14:49:38,539 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse8 (= ~p_dw_st~0 0))) (let ((.cse27 (= ~q_read_ev~0 1)) (.cse26 (= ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ~q_free~0 1)) (.cse28 (<= 2 ~q_write_ev~0)) (.cse4 (not (= ~m_pc~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse7 (not (= ~E_2~0 0))) (.cse14 (<= 2 ~T2_E~0)) (.cse15 (not .cse8)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse17 (= ~m_st~0 0)) (.cse18 (= ~q_free~0 0)) (.cse19 (<= ~t1_pc~0 0)) (.cse6 (= ~q_req_up~0 0)) (.cse20 (= ~c_dr_pc~0 1)) (.cse21 (<= 2 ~E_2~0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~p_dw_i~0 1)) (.cse11 (= ~E_M~0 2)) (.cse23 (= 0 ~t2_st~0)) (.cse24 (= ~token~0 ~local~0)) (.cse12 (= ~E_1~0 2)) (.cse13 (= ~M_E~0 2)) (.cse25 (<= ~t2_pc~0 0))) (or (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~c_dr_pc~0 0) .cse10 (= ~c_last_read~0 ~p_last_write~0) .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse0 .cse16 .cse1 .cse2 .cse17 .cse5 .cse18 .cse19 .cse6 .cse20 .cse21 .cse22 .cse9 .cse10 .cse11 .cse23 .cse24 .cse12 .cse13 .cse25) (and .cse14 .cse15 .cse26 .cse0 .cse1 .cse2 .cse17 .cse3 .cse27 .cse4 .cse28 .cse5 .cse19 .cse6 .cse20 .cse21 .cse10 .cse11 .cse23 .cse24 .cse12 .cse13 .cse25) (and .cse28 (or (and .cse15 .cse26 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse0 .cse1 .cse2 .cse5 .cse18 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13)) .cse19 .cse25) (and .cse14 .cse26 .cse0 .cse1 .cse2 .cse17 .cse3 .cse27 .cse4 .cse28 .cse5 .cse19 .cse6 .cse20 .cse21 .cse22 .cse10 .cse11 .cse23 .cse24 .cse12 .cse13 .cse25) (and .cse14 .cse15 .cse26 .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse28 .cse5 .cse19 .cse6 .cse20 .cse21 .cse22 .cse10 .cse11 .cse23 .cse24 .cse12 .cse13 .cse25) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse18 .cse7 .cse9 (not .cse20) .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse0 .cse16 .cse1 .cse2 .cse17 .cse18 .cse19 .cse6 .cse20 .cse21 .cse22 .cse9 .cse10 .cse11 .cse23 .cse24 .cse12 .cse13 .cse25 (= ~q_write_ev~0 1))))) [2023-12-20 14:49:38,539 INFO L899 garLoopResultBuilder]: For program point eval2_returnLabel#1(lines 751 815) no Hoare annotation was computed. [2023-12-20 14:49:38,539 INFO L899 garLoopResultBuilder]: For program point L606(lines 606 614) no Hoare annotation was computed. [2023-12-20 14:49:38,539 INFO L899 garLoopResultBuilder]: For program point L573(lines 573 577) no Hoare annotation was computed. [2023-12-20 14:49:38,539 INFO L899 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2023-12-20 14:49:38,539 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 185) no Hoare annotation was computed. [2023-12-20 14:49:38,539 INFO L899 garLoopResultBuilder]: For program point L1003(lines 1003 1008) no Hoare annotation was computed. [2023-12-20 14:49:38,539 INFO L899 garLoopResultBuilder]: For program point L970-1(lines 949 982) no Hoare annotation was computed. [2023-12-20 14:49:38,539 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 173 225) no Hoare annotation was computed. [2023-12-20 14:49:38,539 INFO L899 garLoopResultBuilder]: For program point L409(lines 398 411) no Hoare annotation was computed. [2023-12-20 14:49:38,539 INFO L899 garLoopResultBuilder]: For program point L376(lines 376 383) no Hoare annotation was computed. [2023-12-20 14:49:38,539 INFO L895 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: false [2023-12-20 14:49:38,540 INFO L895 garLoopResultBuilder]: At program point L1037(line 1037) the Hoare annotation is: (let ((.cse16 (= ~t2_pc~0 1)) (.cse24 (<= 2 ~m_st~0)) (.cse23 (<= 2 ~t2_st~0)) (.cse28 (= ~m_pc~0 ~t1_pc~0)) (.cse27 (<= ~t1_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (<= ~q_write_ev~0 0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~E_M~0)) (.cse10 (= ~m_st~0 0)) (.cse11 (not (= ~m_pc~0 1))) (.cse12 (= ~q_free~0 0)) (.cse13 (= ~q_req_up~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 2 ~E_2~0)) (.cse17 (= ~m_i~0 1)) (.cse18 (= ~p_dw_st~0 0)) (.cse19 (= ~t2_i~0 1)) (.cse20 (= ~c_dr_pc~0 0)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (= 0 ~t2_st~0)) (.cse22 (= ~token~0 ~local~0)) (.cse26 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~token~0 (+ 2 ~local~0)) .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (+ ~local~0 1) ~token~0) .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse26) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26))) [2023-12-20 14:49:38,540 INFO L899 garLoopResultBuilder]: For program point L1037-1(line 1037) no Hoare annotation was computed. [2023-12-20 14:49:38,540 INFO L899 garLoopResultBuilder]: For program point transmit2_returnLabel#1(lines 602 637) no Hoare annotation was computed. [2023-12-20 14:49:38,540 INFO L899 garLoopResultBuilder]: For program point L707(lines 707 711) no Hoare annotation was computed. [2023-12-20 14:49:38,540 INFO L899 garLoopResultBuilder]: For program point L707-2(lines 706 724) no Hoare annotation was computed. [2023-12-20 14:49:38,540 INFO L899 garLoopResultBuilder]: For program point L245(lines 245 249) no Hoare annotation was computed. [2023-12-20 14:49:38,540 INFO L899 garLoopResultBuilder]: For program point L245-2(lines 244 257) no Hoare annotation was computed. [2023-12-20 14:49:38,540 INFO L899 garLoopResultBuilder]: For program point eval1_returnLabel#1(lines 340 393) no Hoare annotation was computed. [2023-12-20 14:49:38,540 INFO L899 garLoopResultBuilder]: For program point L609(lines 609 613) no Hoare annotation was computed. [2023-12-20 14:49:38,540 INFO L895 garLoopResultBuilder]: At program point L543(line 543) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= ~t1_pc~0 0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (<= 2 ~t2_st~0)) (.cse23 (= ~t1_pc~0 1)) (.cse24 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~T2_E~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (<= ~q_write_ev~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_free~0 0)) (.cse10 (= ~q_req_up~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~m_i~0 1)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~t2_i~0 1)) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= 0 ~t2_st~0)) (.cse19 (= ~token~0 ~local~0)) (.cse20 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse22) (and .cse23 .cse24 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse22) (and .cse23 .cse24 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 (not (= ~m_pc~0 1)) .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) [2023-12-20 14:49:38,540 INFO L899 garLoopResultBuilder]: For program point L543-1(line 543) no Hoare annotation was computed. [2023-12-20 14:49:38,540 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2023-12-20 14:49:38,540 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 184) no Hoare annotation was computed. [2023-12-20 14:49:38,540 INFO L895 garLoopResultBuilder]: At program point L147-1(lines 147 165) the Hoare annotation is: (let ((.cse26 (= ~c_dr_pc~0 1))) (let ((.cse27 (= ~q_req_up~0 1)) (.cse0 (<= 2 ~T2_E~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse7 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse8 (= ~m_st~0 0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~E_2~0)) (.cse18 (= 0 ~t2_st~0)) (.cse19 (= ~token~0 ~local~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse9 (= ~q_free~0 1)) (.cse12 (= ~q_req_up~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~T1_E~0 2)) (.cse28 (not (= ~m_pc~0 1))) (.cse23 (not (= ~c_dr_st~0 0))) (.cse24 (= ~q_free~0 0)) (.cse25 (not (= ~E_2~0 0))) (.cse14 (= ~q_read_ev~0 2)) (.cse15 (not .cse26)) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (= ~E_M~0 2)) (.cse20 (= ~E_1~0 2)) (.cse21 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse23 .cse24 .cse11 .cse12 .cse25 .cse14 .cse16 .cse17 .cse20 .cse21 .cse22) (and .cse0 .cse2 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse26 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse27 .cse0 .cse2 .cse4 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse5 .cse6 .cse7 .cse8 .cse10 .cse23 .cse24 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse27 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse24 .cse11 .cse13 .cse14 .cse15 .cse16 (= ~p_num_write~0 1) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse9 .cse28 .cse23 .cse12 .cse25 .cse14 .cse15 .cse16 .cse17 .cse20 .cse21) (and .cse4 .cse5 .cse6 .cse28 .cse23 .cse24 .cse25 .cse14 .cse15 .cse16 .cse17 .cse20 .cse21)))) [2023-12-20 14:49:38,540 INFO L899 garLoopResultBuilder]: For program point L148(lines 147 165) no Hoare annotation was computed. [2023-12-20 14:49:38,540 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 157) no Hoare annotation was computed. [2023-12-20 14:49:38,541 INFO L895 garLoopResultBuilder]: At program point L1041(line 1041) the Hoare annotation is: (let ((.cse16 (= ~t2_pc~0 1)) (.cse24 (<= 2 ~m_st~0)) (.cse23 (<= 2 ~t2_st~0)) (.cse28 (= ~m_pc~0 ~t1_pc~0)) (.cse27 (<= ~t1_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (<= ~q_write_ev~0 0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~E_M~0)) (.cse10 (= ~m_st~0 0)) (.cse11 (not (= ~m_pc~0 1))) (.cse12 (= ~q_free~0 0)) (.cse13 (= ~q_req_up~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 2 ~E_2~0)) (.cse17 (= ~m_i~0 1)) (.cse18 (= ~p_dw_st~0 0)) (.cse19 (= ~t2_i~0 1)) (.cse20 (= ~c_dr_pc~0 0)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (= 0 ~t2_st~0)) (.cse22 (= ~token~0 ~local~0)) (.cse26 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~token~0 (+ 2 ~local~0)) .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (+ ~local~0 1) ~token~0) .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse26) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26))) [2023-12-20 14:49:38,541 INFO L895 garLoopResultBuilder]: At program point L1041-1(line 1041) the Hoare annotation is: (let ((.cse16 (= ~t2_pc~0 1)) (.cse24 (<= 2 ~m_st~0)) (.cse23 (<= 2 ~t2_st~0)) (.cse28 (= ~m_pc~0 ~t1_pc~0)) (.cse27 (<= ~t1_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (<= ~q_write_ev~0 0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~E_M~0)) (.cse10 (= ~m_st~0 0)) (.cse11 (not (= ~m_pc~0 1))) (.cse12 (= ~q_free~0 0)) (.cse13 (= ~q_req_up~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 2 ~E_2~0)) (.cse17 (= ~m_i~0 1)) (.cse18 (= ~p_dw_st~0 0)) (.cse19 (= ~t2_i~0 1)) (.cse20 (= ~c_dr_pc~0 0)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (= 0 ~t2_st~0)) (.cse22 (= ~token~0 ~local~0)) (.cse26 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~token~0 (+ 2 ~local~0)) .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (+ ~local~0 1) ~token~0) .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse26) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26))) [2023-12-20 14:49:38,541 INFO L899 garLoopResultBuilder]: For program point L975-1(lines 946 983) no Hoare annotation was computed. [2023-12-20 14:49:38,541 INFO L895 garLoopResultBuilder]: At program point L348(line 348) the Hoare annotation is: (let ((.cse12 (= ~c_dr_pc~0 1)) (.cse27 (= ~p_dw_st~0 0))) (let ((.cse24 (= ~p_num_write~0 0)) (.cse28 (= ~c_dr_pc~0 0)) (.cse25 (= ~c_num_read~0 0)) (.cse23 (= ~p_dw_pc~0 0)) (.cse32 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse11 (= ~q_req_up~0 0)) (.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~q_free~0 1)) (.cse29 (= ~c_last_read~0 ~p_last_write~0)) (.cse30 (= ~q_req_up~0 1)) (.cse0 (<= 2 ~T2_E~0)) (.cse31 (not .cse27)) (.cse35 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse5 (= ~m_st~0 0)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~E_2~0)) (.cse14 (= ~p_dw_pc~0 1)) (.cse18 (= 0 ~t2_st~0)) (.cse19 (= ~token~0 ~local~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse7 (not (= ~m_pc~0 1))) (.cse9 (not (= ~c_dr_st~0 0))) (.cse33 (= ~q_free~0 0)) (.cse26 (not (= ~E_2~0 0))) (.cse15 (= ~q_read_ev~0 2)) (.cse34 (not .cse12)) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (= ~E_M~0 2)) (.cse20 (= ~E_1~0 2)) (.cse21 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse24 .cse25 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse11 .cse26 .cse27 .cse15 .cse28 .cse16 .cse29 .cse17 .cse20 .cse21) (and .cse23 .cse0 .cse24 .cse25 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse13 .cse27 .cse15 .cse28 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse30 .cse0 .cse31 .cse25 .cse2 .cse3 .cse4 .cse32 .cse5 .cse8 .cse33 .cse10 .cse13 .cse14 .cse15 .cse34 .cse16 (= ~p_num_write~0 1) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse31 (<= ~q_write_ev~0 0) .cse2 .cse35 .cse3 .cse4 .cse5 .cse7 .cse9 .cse33 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse8 (or (and .cse31 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse11 .cse26 .cse12 .cse15 .cse16 .cse17 .cse20 .cse21) (and .cse31 .cse2 .cse3 .cse4 .cse9 .cse33 .cse11 .cse26 .cse15 .cse16 .cse17 .cse20 .cse21)) .cse10 .cse22) (and .cse0 .cse31 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse32 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse31 .cse2 .cse35 .cse3 .cse4 .cse5 .cse7 .cse8 .cse33 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse30 .cse0 .cse31 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse30 .cse0 .cse31 .cse2 .cse35 .cse3 .cse4 .cse5 .cse8 .cse9 .cse33 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse4 .cse7 .cse9 .cse33 .cse26 .cse15 .cse34 .cse16 .cse17 .cse20 .cse21)))) [2023-12-20 14:49:38,541 INFO L895 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: false [2023-12-20 14:49:38,541 INFO L895 garLoopResultBuilder]: At program point L216-1(lines 188 219) the Hoare annotation is: (let ((.cse27 (= ~c_dr_pc~0 1)) (.cse12 (= ~p_dw_st~0 0))) (let ((.cse7 (= ~q_free~0 1)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse24 (= ~q_req_up~0 1)) (.cse0 (<= 2 ~T2_E~0)) (.cse25 (not .cse12)) (.cse1 (= ~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)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse9 (not (= ~c_dr_st~0 0))) (.cse10 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~E_2~0)) (.cse23 (= ~p_dw_pc~0 1)) (.cse13 (= ~q_read_ev~0 2)) (.cse14 (not .cse27)) (.cse15 (= ~p_dw_i~0 1)) (.cse17 (= ~E_M~0 2)) (.cse18 (= 0 ~t2_st~0)) (.cse19 (= ~token~0 ~local~0)) (.cse20 (= ~E_1~0 2)) (.cse21 (= ~M_E~0 2)) (.cse22 (<= ~t2_pc~0 0))) (or (and (= ~p_dw_pc~0 0) .cse0 (= ~p_num_write~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~q_req_up~0 0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse6 .cse8 .cse11 .cse23 (let ((.cse26 (= ~c_num_read~0 ~p_num_write~0))) (or (and .cse24 .cse25 .cse26 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse27 .cse15 .cse16 .cse17 .cse20 .cse21 .cse22) (and .cse24 .cse25 .cse26 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse13 .cse15 .cse16 .cse17 .cse20 .cse21 .cse22))) .cse18 .cse19) (and .cse24 .cse0 .cse25 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 (= ~q_free~0 0) .cse10 .cse11 .cse23 .cse13 .cse14 .cse15 (= ~p_num_write~0 1) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22)))) [2023-12-20 14:49:38,542 INFO L895 garLoopResultBuilder]: At program point L1042(line 1042) the Hoare annotation is: (let ((.cse16 (= ~t2_pc~0 1)) (.cse24 (<= 2 ~m_st~0)) (.cse23 (<= 2 ~t2_st~0)) (.cse28 (= ~m_pc~0 ~t1_pc~0)) (.cse27 (<= ~t1_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (<= ~q_write_ev~0 0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~E_M~0)) (.cse10 (= ~m_st~0 0)) (.cse11 (not (= ~m_pc~0 1))) (.cse12 (= ~q_free~0 0)) (.cse13 (= ~q_req_up~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 2 ~E_2~0)) (.cse17 (= ~m_i~0 1)) (.cse18 (= ~p_dw_st~0 0)) (.cse19 (= ~t2_i~0 1)) (.cse20 (= ~c_dr_pc~0 0)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (= 0 ~t2_st~0)) (.cse22 (= ~token~0 ~local~0)) (.cse26 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~token~0 (+ 2 ~local~0)) .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (+ ~local~0 1) ~token~0) .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse26) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26))) [2023-12-20 14:49:38,542 INFO L899 garLoopResultBuilder]: For program point L712-1(lines 706 724) no Hoare annotation was computed. [2023-12-20 14:49:38,542 INFO L899 garLoopResultBuilder]: For program point L250-1(lines 241 258) no Hoare annotation was computed. [2023-12-20 14:49:38,542 INFO L895 garLoopResultBuilder]: At program point L1043(line 1043) the Hoare annotation is: (let ((.cse16 (= ~t2_pc~0 1)) (.cse24 (<= 2 ~m_st~0)) (.cse23 (<= 2 ~t2_st~0)) (.cse28 (= ~m_pc~0 ~t1_pc~0)) (.cse27 (<= ~t1_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (<= ~q_write_ev~0 0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~E_M~0)) (.cse10 (= ~m_st~0 0)) (.cse11 (not (= ~m_pc~0 1))) (.cse12 (= ~q_free~0 0)) (.cse13 (= ~q_req_up~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 2 ~E_2~0)) (.cse17 (= ~m_i~0 1)) (.cse18 (= ~p_dw_st~0 0)) (.cse19 (= ~t2_i~0 1)) (.cse20 (= ~c_dr_pc~0 0)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (= 0 ~t2_st~0)) (.cse22 (= ~token~0 ~local~0)) (.cse26 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~token~0 (+ 2 ~local~0)) .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (+ ~local~0 1) ~token~0) .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse26) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26))) [2023-12-20 14:49:38,542 INFO L899 garLoopResultBuilder]: For program point L1010(lines 999 1012) no Hoare annotation was computed. [2023-12-20 14:49:38,542 INFO L895 garLoopResultBuilder]: At program point L581-1(lines 581 594) the Hoare annotation is: (let ((.cse21 (<= 2 ~t2_st~0)) (.cse8 (= ~m_st~0 0)) (.cse20 (= ~token~0 ~local~0)) (.cse9 (not (= ~m_pc~0 1))) (.cse25 (= ~t1_pc~0 1)) (.cse14 (= ~t2_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (<= ~q_write_ev~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse10 (= ~q_free~0 0)) (.cse22 (<= 2 ~m_st~0)) (.cse11 (= ~q_req_up~0 0)) (.cse12 (<= 2 ~T1_E~0)) (.cse13 (<= 2 ~E_2~0)) (.cse15 (= ~m_i~0 1)) (.cse16 (= ~p_dw_st~0 0)) (.cse17 (= ~t2_i~0 1)) (.cse18 (= ~c_dr_pc~0 0)) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (= 0 ~t2_st~0)) (.cse24 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse23 .cse20 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse23 .cse24) (and .cse25 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse23) (and .cse25 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse22 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse23 .cse24))) [2023-12-20 14:49:38,542 INFO L899 garLoopResultBuilder]: For program point L350(line 350) no Hoare annotation was computed. [2023-12-20 14:49:38,542 INFO L899 garLoopResultBuilder]: For program point L781-1(lines 757 809) no Hoare annotation was computed. [2023-12-20 14:49:38,542 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2023-12-20 14:49:38,542 INFO L899 garLoopResultBuilder]: For program point L352-1(lines 347 387) no Hoare annotation was computed. [2023-12-20 14:49:38,542 INFO L899 garLoopResultBuilder]: For program point L1046(line 1046) no Hoare annotation was computed. [2023-12-20 14:49:38,542 INFO L895 garLoopResultBuilder]: At program point L617-1(lines 617 630) the Hoare annotation is: (let ((.cse1 (<= 2 ~t1_st~0)) (.cse20 (= ~m_st~0 0)) (.cse23 (<= ~t1_pc~0 0)) (.cse21 (not (= ~m_pc~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (<= ~q_write_ev~0 0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~E_M~0)) (.cse10 (= ~q_free~0 0)) (.cse11 (<= 2 ~m_st~0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (<= 2 ~E_2~0)) (.cse15 (= ~m_i~0 1)) (.cse16 (= ~p_dw_st~0 0)) (.cse17 (= ~t2_i~0 1)) (.cse18 (= ~c_dr_pc~0 0)) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse22 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse21 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse12 .cse13 .cse14 (= ~t2_pc~0 1) .cse15 (= ~token~0 (+ 2 ~local~0)) .cse16 .cse17 .cse18 .cse19) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~m_pc~0 ~t1_pc~0) .cse9 .cse20 .cse10 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse21 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse21 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22))) [2023-12-20 14:49:38,542 INFO L895 garLoopResultBuilder]: At program point L551-1(lines 537 558) the Hoare annotation is: (let ((.cse10 (not (= ~m_pc~0 1))) (.cse20 (= 0 ~t2_st~0)) (.cse21 (<= ~t2_pc~0 0)) (.cse24 (= ~m_pc~0 ~t1_pc~0)) (.cse25 (<= ~t1_pc~0 0)) (.cse26 (= ~token~0 ~local~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (<= ~q_write_ev~0 0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~E_M~0)) (.cse11 (= ~q_free~0 0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (<= 2 ~E_2~0)) (.cse22 (= ~t2_pc~0 1)) (.cse15 (= ~m_i~0 1)) (.cse16 (= ~p_dw_st~0 0)) (.cse17 (= ~t2_i~0 1)) (.cse18 (= ~c_dr_pc~0 0)) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse19 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24 .cse9 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24 .cse9 .cse11 .cse25 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse19 .cse26 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 (= ~token~0 (+ 2 ~local~0)) .cse16 .cse17 .cse18 .cse19 .cse23))) [2023-12-20 14:49:38,542 INFO L899 garLoopResultBuilder]: For program point L717-1(lines 703 725) no Hoare annotation was computed. [2023-12-20 14:49:38,543 INFO L895 garLoopResultBuilder]: At program point L420(line 420) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (<= 2 ~T2_E~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) (<= 2 ~q_write_ev~0) (<= ~t1_pc~0 0) (= ~q_req_up~0 0) (<= 2 ~E_2~0) (= ~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) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (= ~M_E~0 2) (<= ~t2_pc~0 0)) [2023-12-20 14:49:38,543 INFO L899 garLoopResultBuilder]: For program point L420-1(line 420) no Hoare annotation was computed. [2023-12-20 14:49:38,543 INFO L899 garLoopResultBuilder]: For program point L189(lines 188 219) no Hoare annotation was computed. [2023-12-20 14:49:38,543 INFO L899 garLoopResultBuilder]: For program point L1048(lines 1048 1057) no Hoare annotation was computed. [2023-12-20 14:49:38,543 INFO L899 garLoopResultBuilder]: For program point L1048-2(lines 1048 1057) no Hoare annotation was computed. [2023-12-20 14:49:38,543 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 791) no Hoare annotation was computed. [2023-12-20 14:49:38,543 INFO L899 garLoopResultBuilder]: For program point L784-2(lines 784 791) no Hoare annotation was computed. [2023-12-20 14:49:38,543 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-20 14:49:38,543 INFO L899 garLoopResultBuilder]: For program point L190-1(lines 190 200) no Hoare annotation was computed. [2023-12-20 14:49:38,543 INFO L899 garLoopResultBuilder]: For program point L950(lines 950 954) no Hoare annotation was computed. [2023-12-20 14:49:38,543 INFO L899 garLoopResultBuilder]: For program point L950-2(lines 949 982) no Hoare annotation was computed. [2023-12-20 14:49:38,543 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 (= ~p_dw_st~0 0)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 2)) (.cse14 (= ~E_1~0 2)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) (not (= ~c_dr_st~0 0)) .cse7 (not (= ~E_2~0 0)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 (<= 2 ~T2_E~0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 (<= 2 ~q_write_ev~0) (<= ~t1_pc~0 0) .cse7 (<= 2 ~E_2~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~t2_st~0) (= ~token~0 ~local~0) .cse14 .cse15 (<= ~t2_pc~0 0)))) [2023-12-20 14:49:38,543 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 (= ~p_dw_st~0 0)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 2)) (.cse14 (= ~E_1~0 2)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) (not (= ~c_dr_st~0 0)) .cse7 (not (= ~E_2~0 0)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 (<= 2 ~T2_E~0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 (<= 2 ~q_write_ev~0) (<= ~t1_pc~0 0) .cse7 (<= 2 ~E_2~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~t2_st~0) (= ~token~0 ~local~0) .cse14 .cse15 (<= ~t2_pc~0 0)))) [2023-12-20 14:49:38,543 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 (= ~p_dw_st~0 0)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 2)) (.cse14 (= ~E_1~0 2)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) (not (= ~c_dr_st~0 0)) .cse7 (not (= ~E_2~0 0)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 (<= 2 ~T2_E~0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 (<= 2 ~q_write_ev~0) (<= ~t1_pc~0 0) .cse7 (<= 2 ~E_2~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~t2_st~0) (= ~token~0 ~local~0) .cse14 .cse15 (<= ~t2_pc~0 0)))) [2023-12-20 14:49:38,543 INFO L899 garLoopResultBuilder]: For program point L357(lines 347 387) no Hoare annotation was computed. [2023-12-20 14:49:38,543 INFO L899 garLoopResultBuilder]: For program point L1085(lines 1085 1091) no Hoare annotation was computed. [2023-12-20 14:49:38,544 INFO L895 garLoopResultBuilder]: At program point L1052(line 1052) the Hoare annotation is: (let ((.cse16 (= ~t2_pc~0 1)) (.cse24 (<= 2 ~m_st~0)) (.cse23 (<= 2 ~t2_st~0)) (.cse28 (= ~m_pc~0 ~t1_pc~0)) (.cse27 (<= ~t1_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (<= ~q_write_ev~0 0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~E_M~0)) (.cse10 (= ~m_st~0 0)) (.cse11 (not (= ~m_pc~0 1))) (.cse12 (= ~q_free~0 0)) (.cse13 (= ~q_req_up~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 2 ~E_2~0)) (.cse17 (= ~m_i~0 1)) (.cse18 (= ~p_dw_st~0 0)) (.cse19 (= ~t2_i~0 1)) (.cse20 (= ~c_dr_pc~0 0)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (= 0 ~t2_st~0)) (.cse22 (= ~token~0 ~local~0)) (.cse26 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~token~0 (+ 2 ~local~0)) .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (+ ~local~0 1) ~token~0) .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse26) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26))) [2023-12-20 14:49:38,544 INFO L899 garLoopResultBuilder]: For program point L1052-1(line 1052) no Hoare annotation was computed. [2023-12-20 14:49:38,544 INFO L895 garLoopResultBuilder]: At program point L591(line 591) the Hoare annotation is: (let ((.cse6 (<= ~q_write_ev~0 0)) (.cse20 (= 0 ~t2_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (<= 2 ~T2_E~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (<= 2 ~E_M~0)) (.cse21 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse10 (<= 2 ~m_st~0)) (.cse11 (= ~q_req_up~0 0)) (.cse12 (not (= ~E_2~0 0))) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (= ~m_i~0 1)) (.cse15 (= ~p_dw_st~0 0)) (.cse16 (= ~t2_i~0 1)) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (+ ~local~0 1) ~token~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~t2_pc~0 1) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 (<= ~t2_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2023-12-20 14:49:38,544 INFO L899 garLoopResultBuilder]: For program point L591-1(line 591) no Hoare annotation was computed. [2023-12-20 14:49:38,544 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-20 14:49:38,544 INFO L899 garLoopResultBuilder]: For program point L1087(lines 1087 1090) no Hoare annotation was computed. [2023-12-20 14:49:38,544 INFO L899 garLoopResultBuilder]: For program point L955-1(lines 949 982) no Hoare annotation was computed. [2023-12-20 14:49:38,544 INFO L899 garLoopResultBuilder]: For program point L526(lines 526 534) no Hoare annotation was computed. [2023-12-20 14:49:38,544 INFO L895 garLoopResultBuilder]: At program point L427-1(lines 427 449) the Hoare annotation is: (let ((.cse27 (= ~p_dw_st~0 0))) (let ((.cse23 (= ~p_dw_pc~0 0)) (.cse24 (= ~p_num_write~0 0)) (.cse25 (= ~c_num_read~0 0)) (.cse28 (= ~c_dr_pc~0 0)) (.cse29 (= ~c_last_read~0 ~p_last_write~0)) (.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~q_free~0 1)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse0 (<= 2 ~T2_E~0)) (.cse30 (not .cse27)) (.cse32 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse5 (= ~m_st~0 0)) (.cse10 (<= ~t1_pc~0 0)) (.cse11 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~E_2~0)) (.cse14 (= ~p_dw_pc~0 1)) (.cse18 (= 0 ~t2_st~0)) (.cse19 (= ~token~0 ~local~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse7 (not (= ~m_pc~0 1))) (.cse9 (not (= ~c_dr_st~0 0))) (.cse31 (= ~q_free~0 0)) (.cse26 (not (= ~E_2~0 0))) (.cse15 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_pc~0 1)) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (= ~E_M~0 2)) (.cse20 (= ~E_1~0 2)) (.cse21 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse24 .cse25 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse11 .cse26 .cse27 .cse15 .cse28 .cse16 .cse29 .cse17 .cse20 .cse21) (and .cse23 .cse0 .cse24 .cse25 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse13 .cse27 .cse15 .cse28 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse8 (or (and .cse30 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse11 .cse26 .cse12 .cse15 .cse16 .cse17 .cse20 .cse21) (and .cse30 .cse2 .cse3 .cse4 .cse9 .cse31 .cse11 .cse26 .cse15 .cse16 .cse17 .cse20 .cse21)) .cse10 .cse22) (and .cse0 .cse30 .cse2 .cse32 .cse3 .cse4 .cse5 .cse8 .cse31 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse30 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse30 (<= ~q_write_ev~0 0) .cse2 .cse32 .cse3 .cse4 .cse5 .cse9 .cse31 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse4 .cse7 .cse9 .cse31 .cse26 .cse15 (not .cse12) .cse16 .cse17 .cse20 .cse21)))) [2023-12-20 14:49:38,544 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 368) no Hoare annotation was computed. [2023-12-20 14:49:38,544 INFO L895 garLoopResultBuilder]: At program point L1022(line 1022) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (<= 2 ~T2_E~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (<= ~q_write_ev~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 0) (<= ~t1_pc~0 0) (= ~q_req_up~0 0) (<= 2 ~E_2~0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (= ~M_E~0 2) (<= ~t2_pc~0 0)) [2023-12-20 14:49:38,544 INFO L899 garLoopResultBuilder]: For program point L1022-1(line 1022) no Hoare annotation was computed. [2023-12-20 14:49:38,545 INFO L895 garLoopResultBuilder]: At program point L758(line 758) the Hoare annotation is: (let ((.cse16 (= ~t2_pc~0 1)) (.cse24 (<= 2 ~m_st~0)) (.cse23 (<= 2 ~t2_st~0)) (.cse28 (= ~m_pc~0 ~t1_pc~0)) (.cse27 (<= ~t1_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (<= ~q_write_ev~0 0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~E_M~0)) (.cse10 (= ~m_st~0 0)) (.cse11 (not (= ~m_pc~0 1))) (.cse12 (= ~q_free~0 0)) (.cse13 (= ~q_req_up~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 2 ~E_2~0)) (.cse17 (= ~m_i~0 1)) (.cse18 (= ~p_dw_st~0 0)) (.cse19 (= ~t2_i~0 1)) (.cse20 (= ~c_dr_pc~0 0)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (= 0 ~t2_st~0)) (.cse22 (= ~token~0 ~local~0)) (.cse26 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~token~0 (+ 2 ~local~0)) .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (+ ~local~0 1) ~token~0) .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse26) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26))) [2023-12-20 14:49:38,545 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 496) no Hoare annotation was computed. [2023-12-20 14:49:38,545 INFO L895 garLoopResultBuilder]: At program point L627(line 627) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (<= 2 ~T2_E~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (<= 2 ~m_st~0)) (.cse9 (= ~q_req_up~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (<= 2 ~E_2~0)) (.cse12 (= ~m_i~0 1)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~t2_i~0 1)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~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 .cse14 .cse15 .cse16) (and .cse0 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~q_write_ev~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~t2_pc~0 1) .cse12 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse16))) [2023-12-20 14:49:38,545 INFO L899 garLoopResultBuilder]: For program point L627-1(line 627) no Hoare annotation was computed. [2023-12-20 14:49:38,545 INFO L899 garLoopResultBuilder]: For program point $Ultimate##104(lines 551 557) no Hoare annotation was computed. [2023-12-20 14:49:38,545 INFO L895 garLoopResultBuilder]: At program point L1024(line 1024) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (<= 2 ~T2_E~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (<= ~q_write_ev~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 0) (<= ~t1_pc~0 0) (= ~q_req_up~0 0) (<= 2 ~E_2~0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (= ~M_E~0 2) (<= ~t2_pc~0 0)) [2023-12-20 14:49:38,545 INFO L895 garLoopResultBuilder]: At program point L1024-1(line 1024) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (<= 2 ~T2_E~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (<= ~q_write_ev~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 0) (<= ~t1_pc~0 0) (= ~q_req_up~0 0) (<= 2 ~E_2~0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (= ~M_E~0 2) (<= ~t2_pc~0 0)) [2023-12-20 14:49:38,545 INFO L899 garLoopResultBuilder]: For program point L760(line 760) no Hoare annotation was computed. [2023-12-20 14:49:38,545 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 533) no Hoare annotation was computed. [2023-12-20 14:49:38,545 INFO L899 garLoopResultBuilder]: For program point L496(line 496) no Hoare annotation was computed. [2023-12-20 14:49:38,545 INFO L895 garLoopResultBuilder]: At program point L1025(line 1025) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (<= 2 ~T2_E~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (<= ~q_write_ev~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 0) (<= ~t1_pc~0 0) (= ~q_req_up~0 0) (<= 2 ~E_2~0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (= ~M_E~0 2) (<= ~t2_pc~0 0)) [2023-12-20 14:49:38,545 INFO L899 garLoopResultBuilder]: For program point L84(lines 72 86) no Hoare annotation was computed. [2023-12-20 14:49:38,545 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 69 87) no Hoare annotation was computed. [2023-12-20 14:49:38,545 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 79) no Hoare annotation was computed. [2023-12-20 14:49:38,545 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 69 87) the Hoare annotation is: true [2023-12-20 14:49:38,545 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 82) no Hoare annotation was computed. [2023-12-20 14:49:38,545 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 73 82) no Hoare annotation was computed. [2023-12-20 14:49:38,545 INFO L899 garLoopResultBuilder]: For program point L275(lines 262 277) no Hoare annotation was computed. [2023-12-20 14:49:38,546 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 272) no Hoare annotation was computed. [2023-12-20 14:49:38,546 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 259 278) the Hoare annotation is: true [2023-12-20 14:49:38,546 INFO L899 garLoopResultBuilder]: For program point L263(lines 263 273) no Hoare annotation was computed. [2023-12-20 14:49:38,546 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 259 278) no Hoare annotation was computed. [2023-12-20 14:49:38,546 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 24 31) the Hoare annotation is: true [2023-12-20 14:49:38,546 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 28) no Hoare annotation was computed. [2023-12-20 14:49:38,546 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 24 31) no Hoare annotation was computed. [2023-12-20 14:49:38,546 INFO L899 garLoopResultBuilder]: For program point L734(lines 734 744) no Hoare annotation was computed. [2023-12-20 14:49:38,546 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 745) no Hoare annotation was computed. [2023-12-20 14:49:38,546 INFO L899 garLoopResultBuilder]: For program point L747(lines 729 749) no Hoare annotation was computed. [2023-12-20 14:49:38,546 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 726 750) the Hoare annotation is: true [2023-12-20 14:49:38,546 INFO L899 garLoopResultBuilder]: For program point L738(lines 738 743) no Hoare annotation was computed. [2023-12-20 14:49:38,546 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 726 750) no Hoare annotation was computed. [2023-12-20 14:49:38,546 INFO L899 garLoopResultBuilder]: For program point L306-1(lines 297 314) no Hoare annotation was computed. [2023-12-20 14:49:38,546 INFO L899 garLoopResultBuilder]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2023-12-20 14:49:38,546 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 297 314) the Hoare annotation is: (let ((.cse37 (= ~c_dr_pc~0 1)) (.cse33 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse38 (= ~q_read_ev~0 2)) (.cse25 (= ~p_dw_st~0 0))) (let ((.cse3 (not .cse25)) (.cse5 (not (= ~c_dr_pc~0 0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse11 (not (= ~c_num_read~0 0))) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse18 (and .cse33 .cse38)) (.cse19 (= ~E_2~0 0)) (.cse10 (= ~m_pc~0 1)) (.cse22 (not (= ~q_free~0 0))) (.cse14 (not (= |old(~q_read_ev~0)| 2))) (.cse30 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~q_req_up~0 0))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse20 (< 0 ~t1_pc~0)) (.cse35 (and (= ~q_read_ev~0 1) .cse33)) (.cse32 (< |old(~q_write_ev~0)| 2)) (.cse4 (not (= ~M_E~0 2))) (.cse21 (< ~E_2~0 2)) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse23 (not (= ~p_dw_pc~0 1))) (.cse34 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse24 (< 0 ~t2_pc~0)) (.cse12 (not (= ~E_1~0 ~M_E~0))) (.cse26 (not (= 0 ~t2_st~0))) (.cse13 (not (= ~T1_E~0 ~M_E~0))) (.cse27 (not (= ~m_st~0 0))) (.cse36 (not (= |old(~q_read_ev~0)| 1))) (.cse28 (not .cse37)) (.cse29 (< ~T2_E~0 2)) (.cse15 (not (= ~p_dw_i~0 1))) (.cse16 (not (= ~q_free~0 1))) (.cse31 (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 .cse19) (or .cse0 .cse1 .cse2 .cse20 .cse4 .cse21 .cse6 .cse9 .cse10 .cse22 .cse23 .cse24 .cse12 .cse25 .cse26 .cse13 .cse27 .cse14 .cse28 .cse29 .cse15 .cse30 .cse18 .cse31) (or .cse0 .cse1 .cse2 .cse20 .cse32 .cse4 .cse21 .cse6 .cse9 .cse10 (and .cse33 (= |old(~q_read_ev~0)| ~q_read_ev~0)) .cse23 .cse34 .cse24 .cse12 .cse25 .cse26 .cse13 .cse27 .cse28 .cse29 .cse15 .cse16 .cse19 .cse31) (or .cse1 .cse2 .cse3 .cse20 .cse32 .cse4 .cse21 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse26 .cse13 .cse27 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18 .cse31) (or .cse0 .cse1 .cse2 .cse20 .cse35 .cse32 .cse4 .cse21 .cse6 .cse9 .cse10 .cse34 .cse24 .cse12 .cse25 .cse26 .cse13 .cse27 .cse36 .cse28 .cse29 .cse15 .cse16 .cse19 .cse31) (or .cse20 .cse32 .cse24 (and (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse9 .cse10 .cse34 .cse12 .cse25 .cse13 .cse14 .cse28 .cse15 .cse16 .cse19) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse9 .cse22 .cse12 .cse25 .cse13 .cse14 .cse15 .cse19)) .cse18) (or .cse0 .cse2 .cse4 .cse6 .cse37 .cse9 .cse10 .cse22 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19) (or .cse1 .cse2 .cse20 .cse4 .cse21 .cse6 .cse9 .cse10 .cse22 .cse23 (not (= |old(~q_write_ev~0)| 1)) .cse24 .cse12 .cse25 .cse26 .cse13 .cse27 (and .cse38 (= ~q_write_ev~0 1)) .cse14 .cse28 .cse29 .cse15 .cse30 .cse31) (or .cse0 .cse1 .cse2 .cse20 .cse35 .cse32 .cse4 .cse21 .cse6 .cse9 .cse23 .cse34 .cse24 .cse12 .cse26 .cse13 .cse27 .cse36 .cse28 .cse29 .cse15 .cse16 .cse31)))) [2023-12-20 14:49:38,546 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 297 314) no Hoare annotation was computed. [2023-12-20 14:49:38,546 INFO L899 garLoopResultBuilder]: For program point L863-1(lines 857 890) no Hoare annotation was computed. [2023-12-20 14:49:38,546 INFO L899 garLoopResultBuilder]: For program point L878-1(lines 857 890) no Hoare annotation was computed. [2023-12-20 14:49:38,547 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 854 891) the Hoare annotation is: (let ((.cse6 (< ~m_st~0 2)) (.cse24 (= ~m_pc~0 1)) (.cse29 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (< 0 ~t1_pc~0)) (.cse26 (not (= ~t2_pc~0 1))) (.cse27 (< ~t2_st~0 2)) (.cse0 (not (= ~q_req_up~0 0))) (.cse25 (< ~t1_st~0 2)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~t2_i~0 1))) (.cse4 (not (= ~c_dr_pc~0 0))) (.cse5 (not (= ~m_i~0 1))) (.cse23 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (< 0 ~q_write_ev~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(~E_1~0)| 2)) (.cse14 (< |old(~E_M~0)| 2)) (.cse15 (< 0 ~t2_pc~0)) (.cse16 (not (= 0 ~t2_st~0))) (.cse17 (< |old(~T2_E~0)| 2)) (.cse30 (not (= ~m_st~0 0))) (.cse18 (< |old(~E_2~0)| 2)) (.cse19 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse20 (< |old(~T1_E~0)| 2)) (.cse28 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2))) (.cse21 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))) (.cse22 (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 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse25 .cse1 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse26 (not (= (+ ~local~0 1) ~token~0)) .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse27 .cse19 .cse20 .cse28 .cse21) (or .cse0 .cse29 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse25 .cse1 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse26 .cse27 .cse19 .cse20 .cse21) (or .cse0 .cse25 .cse1 .cse3 (not (= ~token~0 (+ 2 ~local~0))) .cse4 .cse5 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse30 .cse18 .cse26 .cse27 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse26 .cse27 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse27 .cse19 .cse20 .cse21) (or .cse0 .cse25 .cse1 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse26 .cse27 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse25 .cse1 .cse3 .cse4 .cse5 .cse23 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse17 .cse30 .cse18 .cse26 .cse27 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse29 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse30 .cse18 .cse26 .cse27 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse25 .cse1 .cse3 .cse4 .cse5 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse28 .cse21 .cse22))) [2023-12-20 14:49:38,547 INFO L899 garLoopResultBuilder]: For program point L868-1(lines 857 890) no Hoare annotation was computed. [2023-12-20 14:49:38,547 INFO L899 garLoopResultBuilder]: For program point L858-1(lines 857 890) no Hoare annotation was computed. [2023-12-20 14:49:38,547 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 854 891) no Hoare annotation was computed. [2023-12-20 14:49:38,547 INFO L899 garLoopResultBuilder]: For program point L883-1(lines 854 891) no Hoare annotation was computed. [2023-12-20 14:49:38,547 INFO L899 garLoopResultBuilder]: For program point L873-1(lines 857 890) no Hoare annotation was computed. [2023-12-20 14:49:38,549 INFO L445 BasicCegarLoop]: Path program histogram: [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-12-20 14:49:38,550 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 14:49:38,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 02:49:38 BoogieIcfgContainer [2023-12-20 14:49:38,610 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 14:49:38,610 INFO L158 Benchmark]: Toolchain (without parser) took 159500.35ms. Allocated memory was 205.5MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 156.5MB in the beginning and 4.0GB in the end (delta: -3.8GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2023-12-20 14:49:38,610 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 205.5MB. Free memory is still 157.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 14:49:38,610 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.81ms. Allocated memory is still 205.5MB. Free memory was 156.2MB in the beginning and 138.0MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-20 14:49:38,610 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.40ms. Allocated memory is still 205.5MB. Free memory was 138.0MB in the beginning and 135.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 14:49:38,611 INFO L158 Benchmark]: Boogie Preprocessor took 44.91ms. Allocated memory is still 205.5MB. Free memory was 135.2MB in the beginning and 131.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-20 14:49:38,611 INFO L158 Benchmark]: RCFGBuilder took 633.72ms. Allocated memory was 205.5MB in the beginning and 262.1MB in the end (delta: 56.6MB). Free memory was 131.7MB in the beginning and 216.3MB in the end (delta: -84.6MB). Peak memory consumption was 24.8MB. Max. memory is 8.0GB. [2023-12-20 14:49:38,611 INFO L158 Benchmark]: TraceAbstraction took 158521.96ms. Allocated memory was 262.1MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 215.3MB in the beginning and 4.0GB in the end (delta: -3.8GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2023-12-20 14:49:38,611 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.12ms. Allocated memory is still 205.5MB. Free memory is still 157.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 248.81ms. Allocated memory is still 205.5MB. Free memory was 156.2MB in the beginning and 138.0MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.40ms. Allocated memory is still 205.5MB. Free memory was 138.0MB in the beginning and 135.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.91ms. Allocated memory is still 205.5MB. Free memory was 135.2MB in the beginning and 131.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 633.72ms. Allocated memory was 205.5MB in the beginning and 262.1MB in the end (delta: 56.6MB). Free memory was 131.7MB in the beginning and 216.3MB in the end (delta: -84.6MB). Peak memory consumption was 24.8MB. Max. memory is 8.0GB. * TraceAbstraction took 158521.96ms. Allocated memory was 262.1MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 215.3MB in the beginning and 4.0GB in the end (delta: -3.8GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. * 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, 209 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 158.4s, OverallIterations: 47, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, AutomataDifference: 42.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 74.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20864 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20379 mSDsluCounter, 29884 SdHoareTripleChecker+Invalid, 10.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19375 mSDsCounter, 3750 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22395 IncrementalHoareTripleChecker+Invalid, 26145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3750 mSolverCounterUnsat, 10509 mSDtfsCounter, 22395 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6117 GetRequests, 5618 SyntacticMatches, 4 SemanticMatches, 495 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33896occurred in iteration=32, InterpolantAutomatonStates: 425, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 27.8s AutomataMinimizationTime, 47 MinimizatonAttempts, 23932 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 23867 PreInvPairs, 24748 NumberOfFragments, 28504 HoareAnnotationTreeSize, 23867 FormulaSimplifications, 220797 FormulaSimplificationTreeSizeReduction, 25.4s HoareSimplificationTime, 52 FormulaSimplificationsInter, 290471 FormulaSimplificationTreeSizeReductionInter, 48.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 9648 NumberOfCodeBlocks, 9482 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 10054 ConstructedInterpolants, 0 QuantifiedInterpolants, 17206 SizeOfPredicates, 4 NumberOfNonLiveVariables, 13686 ConjunctsInSsa, 117 ConjunctsInUnsatCore, 75 InterpolantComputations, 45 PerfectInterpolantSequences, 6653/7280 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: 581]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st)) || (((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || ((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || ((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (t2_pc <= 0))) || ((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st))) || ((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (t2_pc <= 0))) - InvariantResult [Line: 757]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st)) || (((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (token == (2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || ((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || (((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (t2_pc <= 0))) || (((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st))) || ((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st))) || (((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || ((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (t2_pc <= 0))) || ((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || ((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || ((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || (((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) - InvariantResult [Line: 537]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (t2_pc <= 0)) || ((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || ((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || ((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (token == (2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((p_dw_pc == 0) && (2 <= T2_E)) && (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)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= E_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)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0)) || ((((((((2 <= T2_E) && (m_st == 0)) && (2 <= q_write_ev)) && (2 <= E_2)) && (p_dw_pc == 1)) && (((((((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (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)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0)) || ((((((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0)))) && (0 == t2_st)) && (token == local))) || ((((((((((((((((((((((((q_req_up == 1) && (2 <= T2_E)) && !((p_dw_st == 0))) && (c_num_read == 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)) && (2 <= E_2)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (p_num_write == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) - InvariantResult [Line: 1029]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st)) || (((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (token == (2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || ((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || (((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (t2_pc <= 0))) || (((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st))) || ((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st))) || (((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || ((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (t2_pc <= 0))) || ((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || ((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || ((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || (((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) - InvariantResult [Line: 617]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) || ((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (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)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (token == (2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || (((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || (((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 <= T2_E) && (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)) && (2 <= q_write_ev)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= E_2)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0)) || (((((((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && !((E_2 == 0))) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || (((((((((((((((((((((2 <= T2_E) && !((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)) && (2 <= E_2)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || (((((((((((((((((((((q_req_up == 1) && (2 <= T2_E)) && !((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)) && (2 <= E_2)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || ((((((((((((((((((((((q_req_up == 1) && (2 <= T2_E)) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= E_2)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (p_num_write == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_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)) && !((E_2 == 0))) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (E_M == 2)) && (E_1 == 2)) && (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)) && !((E_2 == 0))) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) - InvariantResult [Line: 427]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((2 <= T2_E) && (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)) && (2 <= E_2)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0)) || (((((((((((((((((((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)) && !((E_2 == 0))) && (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)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((((((((((((p_dw_pc == 0) && (2 <= T2_E)) && (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)) && (2 <= q_write_ev)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= E_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)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || ((((2 <= q_write_ev) && (((((((((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((c_dr_st == 0))) && (q_req_up == 0)) && !((E_2 == 0))) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2)) || ((((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((c_dr_st == 0))) && (q_free == 0)) && (q_req_up == 0)) && !((E_2 == 0))) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2)))) && (t1_pc <= 0)) && (t2_pc <= 0))) || ((((((((((((((((((((((2 <= T2_E) && !((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)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (2 <= E_2)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || (((((((((((((((((((((((2 <= T2_E) && !((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)) && (2 <= E_2)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || (((((((((((((((((((((((2 <= T2_E) && !((p_dw_st == 0))) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (2 <= E_2)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || (((((((((((((p_last_write == q_buf_0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_free == 0)) && !((E_2 == 0))) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((2 <= T2_E) && (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)) && (2 <= E_2)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0)) || (((((((((((((((((((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)) && !((E_2 == 0))) && (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)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((((((((((((p_dw_pc == 0) && (2 <= T2_E)) && (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)) && (2 <= q_write_ev)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= E_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)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || ((((((((((((((((((((((((q_req_up == 1) && (2 <= T2_E)) && !((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)) && (2 <= q_write_ev)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= E_2)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (p_num_write == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || ((((((((((((((((((((((((2 <= T2_E) && !((p_dw_st == 0))) && (q_write_ev <= 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))) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (2 <= E_2)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || ((((2 <= q_write_ev) && (((((((((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((c_dr_st == 0))) && (q_req_up == 0)) && !((E_2 == 0))) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2)) || ((((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((c_dr_st == 0))) && (q_free == 0)) && (q_req_up == 0)) && !((E_2 == 0))) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2)))) && (t1_pc <= 0)) && (t2_pc <= 0))) || (((((((((((((((((((((((2 <= T2_E) && !((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)) && (2 <= E_2)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || ((((((((((((((((((((((((p_dw_pc == 0) && (2 <= T2_E)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (2 <= E_2)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || (((((((((((((((((((((((2 <= T2_E) && !((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)) && (2 <= E_2)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || (((((((((((((((((((((((q_req_up == 1) && (2 <= T2_E)) && !((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)) && (2 <= E_2)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || ((((((((((((((((((((((q_req_up == 1) && (2 <= T2_E)) && !((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)) && (2 <= E_2)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || (((((((((((((p_last_write == q_buf_0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_free == 0)) && !((E_2 == 0))) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) RESULT: Ultimate proved your program to be correct! [2023-12-20 14:49:38,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...