/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 01:39:29,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 01:39:29,286 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-19 01:39:29,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 01:39:29,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 01:39:29,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 01:39:29,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 01:39:29,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 01:39:29,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 01:39:29,321 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 01:39:29,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 01:39:29,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 01:39:29,322 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 01:39:29,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 01:39:29,323 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 01:39:29,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 01:39:29,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 01:39:29,324 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 01:39:29,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 01:39:29,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 01:39:29,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 01:39:29,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 01:39:29,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 01:39:29,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 01:39:29,325 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 01:39:29,325 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 01:39:29,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 01:39:29,326 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 01:39:29,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 01:39:29,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 01:39:29,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 01:39:29,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 01:39:29,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 01:39:29,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 01:39:29,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 01:39:29,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 01:39:29,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 01:39:29,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 01:39:29,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 01:39:29,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 01:39:29,329 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 01:39:29,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 01:39:29,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 01:39:29,330 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 -> true [2023-12-19 01:39:29,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 01:39:29,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 01:39:29,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 01:39:29,569 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 01:39:29,569 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 01:39:29,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2023-12-19 01:39:30,588 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 01:39:30,776 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 01:39:30,777 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2023-12-19 01:39:30,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a4ef2d18/2ff623de01ae4084938314d08a8ddaa6/FLAGa44add3e2 [2023-12-19 01:39:30,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a4ef2d18/2ff623de01ae4084938314d08a8ddaa6 [2023-12-19 01:39:30,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 01:39:30,811 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 01:39:30,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 01:39:30,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 01:39:30,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 01:39:30,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:39:30" (1/1) ... [2023-12-19 01:39:30,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b1bc236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:39:30, skipping insertion in model container [2023-12-19 01:39:30,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:39:30" (1/1) ... [2023-12-19 01:39:30,854 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 01:39:30,994 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_3.cil+token_ring.01.cil-1.c[911,924] [2023-12-19 01:39:31,040 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_3.cil+token_ring.01.cil-1.c[8416,8429] [2023-12-19 01:39:31,061 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 01:39:31,071 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 01:39:31,079 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_3.cil+token_ring.01.cil-1.c[911,924] [2023-12-19 01:39:31,111 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_3.cil+token_ring.01.cil-1.c[8416,8429] [2023-12-19 01:39:31,123 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 01:39:31,135 INFO L206 MainTranslator]: Completed translation [2023-12-19 01:39:31,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:39:31 WrapperNode [2023-12-19 01:39:31,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 01:39:31,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 01:39:31,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 01:39:31,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 01:39:31,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:39:31" (1/1) ... [2023-12-19 01:39:31,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:39:31" (1/1) ... [2023-12-19 01:39:31,179 INFO L138 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 446 [2023-12-19 01:39:31,179 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 01:39:31,180 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 01:39:31,180 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 01:39:31,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 01:39:31,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:39:31" (1/1) ... [2023-12-19 01:39:31,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:39:31" (1/1) ... [2023-12-19 01:39:31,195 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:39:31" (1/1) ... [2023-12-19 01:39:31,211 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-19 01:39:31,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:39:31" (1/1) ... [2023-12-19 01:39:31,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:39:31" (1/1) ... [2023-12-19 01:39:31,227 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:39:31" (1/1) ... [2023-12-19 01:39:31,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:39:31" (1/1) ... [2023-12-19 01:39:31,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:39:31" (1/1) ... [2023-12-19 01:39:31,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:39:31" (1/1) ... [2023-12-19 01:39:31,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 01:39:31,260 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 01:39:31,261 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 01:39:31,261 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 01:39:31,262 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:39:31" (1/1) ... [2023-12-19 01:39:31,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 01:39:31,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:39:31,299 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-19 01:39:31,317 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-19 01:39:31,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 01:39:31,340 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-19 01:39:31,340 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-19 01:39:31,342 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-12-19 01:39:31,342 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-12-19 01:39:31,343 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-19 01:39:31,343 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-19 01:39:31,343 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-19 01:39:31,343 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-19 01:39:31,343 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-12-19 01:39:31,343 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-12-19 01:39:31,343 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-19 01:39:31,343 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-19 01:39:31,343 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-19 01:39:31,344 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-19 01:39:31,344 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-12-19 01:39:31,344 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-12-19 01:39:31,344 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-12-19 01:39:31,344 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-12-19 01:39:31,344 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-12-19 01:39:31,344 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-12-19 01:39:31,344 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-19 01:39:31,345 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-19 01:39:31,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 01:39:31,345 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-19 01:39:31,346 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-19 01:39:31,346 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-12-19 01:39:31,347 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-12-19 01:39:31,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 01:39:31,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 01:39:31,347 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-19 01:39:31,347 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-19 01:39:31,458 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 01:39:31,461 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 01:39:31,847 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2023-12-19 01:39:31,848 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2023-12-19 01:39:31,890 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 01:39:31,918 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 01:39:31,918 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-12-19 01:39:31,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:39:31 BoogieIcfgContainer [2023-12-19 01:39:31,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 01:39:31,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 01:39:31,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 01:39:31,923 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 01:39:31,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 01:39:30" (1/3) ... [2023-12-19 01:39:31,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a06698a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:39:31, skipping insertion in model container [2023-12-19 01:39:31,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:39:31" (2/3) ... [2023-12-19 01:39:31,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a06698a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:39:31, skipping insertion in model container [2023-12-19 01:39:31,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:39:31" (3/3) ... [2023-12-19 01:39:31,925 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-1.c [2023-12-19 01:39:31,937 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 01:39:31,937 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-19 01:39:31,970 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 01:39:31,975 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;@1b51532d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 01:39:31,975 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-19 01:39:31,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 199 states, 151 states have (on average 1.6225165562913908) internal successors, (245), 157 states have internal predecessors, (245), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-19 01:39:31,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-19 01:39:31,990 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:31,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:31,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:31,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:31,997 INFO L85 PathProgramCache]: Analyzing trace with hash 635992734, now seen corresponding path program 1 times [2023-12-19 01:39:32,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:32,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395959375] [2023-12-19 01:39:32,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:32,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:32,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:32,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:39:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:32,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:39:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:32,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:39:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:32,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:39:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:32,339 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-19 01:39:32,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:32,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395959375] [2023-12-19 01:39:32,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395959375] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:32,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:32,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:39:32,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835260569] [2023-12-19 01:39:32,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:32,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:39:32,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:32,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:39:32,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:39:32,367 INFO L87 Difference]: Start difference. First operand has 199 states, 151 states have (on average 1.6225165562913908) internal successors, (245), 157 states have internal predecessors, (245), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:39:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:33,102 INFO L93 Difference]: Finished difference Result 507 states and 787 transitions. [2023-12-19 01:39:33,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 01:39:33,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-12-19 01:39:33,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:33,113 INFO L225 Difference]: With dead ends: 507 [2023-12-19 01:39:33,113 INFO L226 Difference]: Without dead ends: 317 [2023-12-19 01:39:33,116 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-19 01:39:33,118 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 524 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:33,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 553 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:39:33,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-12-19 01:39:33,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 278. [2023-12-19 01:39:33,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 215 states have (on average 1.4930232558139536) internal successors, (321), 220 states have internal predecessors, (321), 41 states have call successors, (41), 20 states have call predecessors, (41), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2023-12-19 01:39:33,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 404 transitions. [2023-12-19 01:39:33,165 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 404 transitions. Word has length 51 [2023-12-19 01:39:33,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:33,166 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 404 transitions. [2023-12-19 01:39:33,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:39:33,166 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 404 transitions. [2023-12-19 01:39:33,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-19 01:39:33,168 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:33,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:33,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 01:39:33,168 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:33,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:33,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1482341282, now seen corresponding path program 1 times [2023-12-19 01:39:33,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:33,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167572811] [2023-12-19 01:39:33,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:33,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:33,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:33,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:39:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:33,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:39:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:33,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:39:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:33,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:39:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:33,326 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-19 01:39:33,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:33,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167572811] [2023-12-19 01:39:33,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167572811] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:33,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:33,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:39:33,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149716442] [2023-12-19 01:39:33,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:33,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:39:33,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:33,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:39:33,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:33,329 INFO L87 Difference]: Start difference. First operand 278 states and 404 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:39:33,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:33,982 INFO L93 Difference]: Finished difference Result 588 states and 856 transitions. [2023-12-19 01:39:33,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 01:39:33,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-12-19 01:39:33,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:33,998 INFO L225 Difference]: With dead ends: 588 [2023-12-19 01:39:33,998 INFO L226 Difference]: Without dead ends: 418 [2023-12-19 01:39:33,999 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-19 01:39:34,000 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 510 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:34,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 804 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:39:34,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2023-12-19 01:39:34,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 357. [2023-12-19 01:39:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 277 states have (on average 1.48014440433213) internal successors, (410), 283 states have internal predecessors, (410), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2023-12-19 01:39:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 515 transitions. [2023-12-19 01:39:34,040 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 515 transitions. Word has length 51 [2023-12-19 01:39:34,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:34,040 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 515 transitions. [2023-12-19 01:39:34,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:39:34,041 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 515 transitions. [2023-12-19 01:39:34,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-19 01:39:34,046 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:34,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:34,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 01:39:34,047 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:34,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:34,048 INFO L85 PathProgramCache]: Analyzing trace with hash 110533984, now seen corresponding path program 1 times [2023-12-19 01:39:34,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:34,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551955464] [2023-12-19 01:39:34,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:34,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:34,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:34,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:39:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:34,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:39:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:34,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:39:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:34,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:39:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:34,169 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-19 01:39:34,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:34,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551955464] [2023-12-19 01:39:34,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551955464] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:34,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:34,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:39:34,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400999455] [2023-12-19 01:39:34,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:34,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:39:34,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:34,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:39:34,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:34,171 INFO L87 Difference]: Start difference. First operand 357 states and 515 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:39:34,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:34,937 INFO L93 Difference]: Finished difference Result 898 states and 1297 transitions. [2023-12-19 01:39:34,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 01:39:34,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-12-19 01:39:34,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:34,942 INFO L225 Difference]: With dead ends: 898 [2023-12-19 01:39:34,942 INFO L226 Difference]: Without dead ends: 649 [2023-12-19 01:39:34,944 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-19 01:39:34,947 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 522 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:34,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 795 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:39:34,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2023-12-19 01:39:34,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 512. [2023-12-19 01:39:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 400 states have (on average 1.4675) internal successors, (587), 408 states have internal predecessors, (587), 69 states have call successors, (69), 38 states have call predecessors, (69), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2023-12-19 01:39:35,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 736 transitions. [2023-12-19 01:39:35,001 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 736 transitions. Word has length 51 [2023-12-19 01:39:35,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:35,001 INFO L495 AbstractCegarLoop]: Abstraction has 512 states and 736 transitions. [2023-12-19 01:39:35,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:39:35,002 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 736 transitions. [2023-12-19 01:39:35,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-19 01:39:35,004 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:35,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:35,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 01:39:35,004 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:35,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:35,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1734833182, now seen corresponding path program 1 times [2023-12-19 01:39:35,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:35,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089003844] [2023-12-19 01:39:35,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:35,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:35,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:35,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:39:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:35,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:39:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:35,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:39:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:35,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:39:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:35,121 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-19 01:39:35,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:35,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089003844] [2023-12-19 01:39:35,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089003844] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:35,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:35,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:39:35,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20994811] [2023-12-19 01:39:35,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:35,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:39:35,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:35,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:39:35,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:35,125 INFO L87 Difference]: Start difference. First operand 512 states and 736 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:39:35,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:35,971 INFO L93 Difference]: Finished difference Result 2323 states and 3463 transitions. [2023-12-19 01:39:35,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-19 01:39:35,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-12-19 01:39:35,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:35,980 INFO L225 Difference]: With dead ends: 2323 [2023-12-19 01:39:35,981 INFO L226 Difference]: Without dead ends: 1920 [2023-12-19 01:39:35,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-12-19 01:39:35,990 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 1042 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:35,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 677 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:39:35,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2023-12-19 01:39:36,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1600. [2023-12-19 01:39:36,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1245 states have (on average 1.427309236947791) internal successors, (1777), 1280 states have internal predecessors, (1777), 210 states have call successors, (210), 128 states have call predecessors, (210), 143 states have return successors, (305), 196 states have call predecessors, (305), 208 states have call successors, (305) [2023-12-19 01:39:36,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2292 transitions. [2023-12-19 01:39:36,072 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2292 transitions. Word has length 51 [2023-12-19 01:39:36,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:36,073 INFO L495 AbstractCegarLoop]: Abstraction has 1600 states and 2292 transitions. [2023-12-19 01:39:36,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:39:36,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2292 transitions. [2023-12-19 01:39:36,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-19 01:39:36,075 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:36,076 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] [2023-12-19 01:39:36,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 01:39:36,076 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:36,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:36,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1245975289, now seen corresponding path program 1 times [2023-12-19 01:39:36,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:36,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87730636] [2023-12-19 01:39:36,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:36,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:36,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:36,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:36,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:39:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:36,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:39:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:36,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:39:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:36,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:39:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:36,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:39:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:36,221 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-19 01:39:36,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:36,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87730636] [2023-12-19 01:39:36,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87730636] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:36,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:36,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 01:39:36,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079259154] [2023-12-19 01:39:36,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:36,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 01:39:36,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:36,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 01:39:36,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:39:36,224 INFO L87 Difference]: Start difference. First operand 1600 states and 2292 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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-19 01:39:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:36,818 INFO L93 Difference]: Finished difference Result 1832 states and 2639 transitions. [2023-12-19 01:39:36,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 01:39:36,819 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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 57 [2023-12-19 01:39:36,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:36,826 INFO L225 Difference]: With dead ends: 1832 [2023-12-19 01:39:36,827 INFO L226 Difference]: Without dead ends: 1738 [2023-12-19 01:39:36,830 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-19 01:39:36,830 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 578 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:36,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 724 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:39:36,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2023-12-19 01:39:36,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1701. [2023-12-19 01:39:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1324 states have (on average 1.4297583081570997) internal successors, (1893), 1361 states have internal predecessors, (1893), 223 states have call successors, (223), 135 states have call predecessors, (223), 152 states have return successors, (323), 210 states have call predecessors, (323), 221 states have call successors, (323) [2023-12-19 01:39:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2439 transitions. [2023-12-19 01:39:36,925 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2439 transitions. Word has length 57 [2023-12-19 01:39:36,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:36,925 INFO L495 AbstractCegarLoop]: Abstraction has 1701 states and 2439 transitions. [2023-12-19 01:39:36,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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-19 01:39:36,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2439 transitions. [2023-12-19 01:39:36,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-19 01:39:36,926 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:36,926 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] [2023-12-19 01:39:36,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 01:39:36,927 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:36,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:36,927 INFO L85 PathProgramCache]: Analyzing trace with hash -698017479, now seen corresponding path program 1 times [2023-12-19 01:39:36,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:36,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412883662] [2023-12-19 01:39:36,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:36,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:36,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:37,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:37,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:39:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:37,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:39:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:37,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:39:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:37,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:39:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:37,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:39:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:37,048 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-19 01:39:37,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:37,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412883662] [2023-12-19 01:39:37,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412883662] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:37,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:37,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 01:39:37,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351933567] [2023-12-19 01:39:37,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:37,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 01:39:37,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:37,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 01:39:37,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:39:37,050 INFO L87 Difference]: Start difference. First operand 1701 states and 2439 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 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-19 01:39:37,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:37,923 INFO L93 Difference]: Finished difference Result 2062 states and 2969 transitions. [2023-12-19 01:39:37,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 01:39:37,923 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 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 57 [2023-12-19 01:39:37,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:37,931 INFO L225 Difference]: With dead ends: 2062 [2023-12-19 01:39:37,931 INFO L226 Difference]: Without dead ends: 1874 [2023-12-19 01:39:37,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-12-19 01:39:37,933 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 554 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:37,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1049 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:39:37,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2023-12-19 01:39:38,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1802. [2023-12-19 01:39:38,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1403 states have (on average 1.4312188168210978) internal successors, (2008), 1442 states have internal predecessors, (2008), 236 states have call successors, (236), 142 states have call predecessors, (236), 161 states have return successors, (344), 224 states have call predecessors, (344), 234 states have call successors, (344) [2023-12-19 01:39:38,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2588 transitions. [2023-12-19 01:39:38,061 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2588 transitions. Word has length 57 [2023-12-19 01:39:38,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:38,061 INFO L495 AbstractCegarLoop]: Abstraction has 1802 states and 2588 transitions. [2023-12-19 01:39:38,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 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-19 01:39:38,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2588 transitions. [2023-12-19 01:39:38,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-19 01:39:38,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:38,063 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] [2023-12-19 01:39:38,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 01:39:38,063 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:38,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:38,064 INFO L85 PathProgramCache]: Analyzing trace with hash 195468859, now seen corresponding path program 1 times [2023-12-19 01:39:38,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:38,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715592320] [2023-12-19 01:39:38,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:38,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:39:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:39:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:39:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:39:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:39:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,133 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-19 01:39:38,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:38,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715592320] [2023-12-19 01:39:38,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715592320] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:38,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:38,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:39:38,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942965550] [2023-12-19 01:39:38,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:38,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:39:38,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:38,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:39:38,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:38,135 INFO L87 Difference]: Start difference. First operand 1802 states and 2588 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-19 01:39:38,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:38,689 INFO L93 Difference]: Finished difference Result 2408 states and 3464 transitions. [2023-12-19 01:39:38,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 01:39:38,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 57 [2023-12-19 01:39:38,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:38,697 INFO L225 Difference]: With dead ends: 2408 [2023-12-19 01:39:38,697 INFO L226 Difference]: Without dead ends: 2125 [2023-12-19 01:39:38,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-12-19 01:39:38,699 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 784 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:38,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 628 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:39:38,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2023-12-19 01:39:38,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2054. [2023-12-19 01:39:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 1600 states have (on average 1.42875) internal successors, (2286), 1643 states have internal predecessors, (2286), 266 states have call successors, (266), 163 states have call predecessors, (266), 186 states have return successors, (382), 254 states have call predecessors, (382), 264 states have call successors, (382) [2023-12-19 01:39:38,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2934 transitions. [2023-12-19 01:39:38,801 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2934 transitions. Word has length 57 [2023-12-19 01:39:38,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:38,801 INFO L495 AbstractCegarLoop]: Abstraction has 2054 states and 2934 transitions. [2023-12-19 01:39:38,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-19 01:39:38,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2934 transitions. [2023-12-19 01:39:38,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-19 01:39:38,802 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:38,802 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-19 01:39:38,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 01:39:38,802 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:38,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:38,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1598588300, now seen corresponding path program 1 times [2023-12-19 01:39:38,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:38,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391750838] [2023-12-19 01:39:38,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:38,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:39:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:39:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 01:39:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-19 01:39:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,950 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-19 01:39:38,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:38,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391750838] [2023-12-19 01:39:38,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391750838] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:38,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:38,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 01:39:38,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756101662] [2023-12-19 01:39:38,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:38,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 01:39:38,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:38,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 01:39:38,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:39:38,952 INFO L87 Difference]: Start difference. First operand 2054 states and 2934 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-19 01:39:39,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:39,630 INFO L93 Difference]: Finished difference Result 2662 states and 3804 transitions. [2023-12-19 01:39:39,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 01:39:39,630 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-19 01:39:39,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:39,639 INFO L225 Difference]: With dead ends: 2662 [2023-12-19 01:39:39,639 INFO L226 Difference]: Without dead ends: 2127 [2023-12-19 01:39:39,641 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-19 01:39:39,643 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 215 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:39,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1024 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:39:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2023-12-19 01:39:39,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 2066. [2023-12-19 01:39:39,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2066 states, 1609 states have (on average 1.4244872591671847) internal successors, (2292), 1652 states have internal predecessors, (2292), 266 states have call successors, (266), 163 states have call predecessors, (266), 189 states have return successors, (385), 257 states have call predecessors, (385), 264 states have call successors, (385) [2023-12-19 01:39:39,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 2943 transitions. [2023-12-19 01:39:39,789 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 2943 transitions. Word has length 58 [2023-12-19 01:39:39,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:39,789 INFO L495 AbstractCegarLoop]: Abstraction has 2066 states and 2943 transitions. [2023-12-19 01:39:39,789 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-19 01:39:39,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 2943 transitions. [2023-12-19 01:39:39,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-19 01:39:39,791 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:39,791 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-19 01:39:39,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 01:39:39,792 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:39,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:39,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1670974858, now seen corresponding path program 1 times [2023-12-19 01:39:39,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:39,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678812226] [2023-12-19 01:39:39,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:39,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:39,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:39,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:39,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:39:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:39,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:39:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:39,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:39,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 01:39:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:39,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-19 01:39:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:39,942 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-19 01:39:39,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:39,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678812226] [2023-12-19 01:39:39,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678812226] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:39,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:39,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 01:39:39,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727836203] [2023-12-19 01:39:39,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:39,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 01:39:39,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:39,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 01:39:39,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:39:39,945 INFO L87 Difference]: Start difference. First operand 2066 states and 2943 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-19 01:39:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:41,452 INFO L93 Difference]: Finished difference Result 4065 states and 5858 transitions. [2023-12-19 01:39:41,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-19 01:39:41,453 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2023-12-19 01:39:41,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:41,462 INFO L225 Difference]: With dead ends: 4065 [2023-12-19 01:39:41,462 INFO L226 Difference]: Without dead ends: 2399 [2023-12-19 01:39:41,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2023-12-19 01:39:41,467 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 1153 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 1799 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:41,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 1339 Invalid, 2110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1799 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-19 01:39:41,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2023-12-19 01:39:41,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 2269. [2023-12-19 01:39:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2269 states, 1756 states have (on average 1.4071753986332574) internal successors, (2471), 1803 states have internal predecessors, (2471), 296 states have call successors, (296), 184 states have call predecessors, (296), 215 states have return successors, (434), 288 states have call predecessors, (434), 294 states have call successors, (434) [2023-12-19 01:39:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2269 states to 2269 states and 3201 transitions. [2023-12-19 01:39:41,622 INFO L78 Accepts]: Start accepts. Automaton has 2269 states and 3201 transitions. Word has length 58 [2023-12-19 01:39:41,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:41,623 INFO L495 AbstractCegarLoop]: Abstraction has 2269 states and 3201 transitions. [2023-12-19 01:39:41,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-19 01:39:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2269 states and 3201 transitions. [2023-12-19 01:39:41,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-19 01:39:41,625 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:41,625 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-19 01:39:41,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 01:39:41,625 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:41,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:41,626 INFO L85 PathProgramCache]: Analyzing trace with hash -753332195, now seen corresponding path program 1 times [2023-12-19 01:39:41,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:41,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050540378] [2023-12-19 01:39:41,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:41,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:41,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:41,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:41,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:39:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:41,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:39:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:41,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:41,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:39:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:41,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 01:39:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:41,713 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-19 01:39:41,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:41,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050540378] [2023-12-19 01:39:41,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050540378] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:41,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:41,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 01:39:41,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25254778] [2023-12-19 01:39:41,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:41,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 01:39:41,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:41,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 01:39:41,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:39:41,714 INFO L87 Difference]: Start difference. First operand 2269 states and 3201 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-19 01:39:42,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:42,266 INFO L93 Difference]: Finished difference Result 3152 states and 4440 transitions. [2023-12-19 01:39:42,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 01:39:42,266 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-19 01:39:42,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:42,276 INFO L225 Difference]: With dead ends: 3152 [2023-12-19 01:39:42,276 INFO L226 Difference]: Without dead ends: 2402 [2023-12-19 01:39:42,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-12-19 01:39:42,280 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 309 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:42,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 888 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:39:42,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2023-12-19 01:39:42,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 2305. [2023-12-19 01:39:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2305 states, 1783 states have (on average 1.4010095344924285) internal successors, (2498), 1830 states have internal predecessors, (2498), 296 states have call successors, (296), 184 states have call predecessors, (296), 224 states have return successors, (443), 297 states have call predecessors, (443), 294 states have call successors, (443) [2023-12-19 01:39:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 3237 transitions. [2023-12-19 01:39:42,438 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 3237 transitions. Word has length 59 [2023-12-19 01:39:42,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:42,438 INFO L495 AbstractCegarLoop]: Abstraction has 2305 states and 3237 transitions. [2023-12-19 01:39:42,438 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-19 01:39:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 3237 transitions. [2023-12-19 01:39:42,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-19 01:39:42,439 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:42,440 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-19 01:39:42,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 01:39:42,440 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:42,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:42,440 INFO L85 PathProgramCache]: Analyzing trace with hash -612783585, now seen corresponding path program 1 times [2023-12-19 01:39:42,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:42,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582472859] [2023-12-19 01:39:42,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:42,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:42,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:42,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:42,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:39:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:42,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:39:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:42,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:42,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:39:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:42,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 01:39:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:42,526 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-19 01:39:42,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:42,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582472859] [2023-12-19 01:39:42,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582472859] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:42,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:42,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 01:39:42,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974072748] [2023-12-19 01:39:42,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:42,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 01:39:42,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:42,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 01:39:42,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:39:42,527 INFO L87 Difference]: Start difference. First operand 2305 states and 3237 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:39:43,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:43,416 INFO L93 Difference]: Finished difference Result 3199 states and 4454 transitions. [2023-12-19 01:39:43,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-19 01:39:43,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2023-12-19 01:39:43,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:43,431 INFO L225 Difference]: With dead ends: 3199 [2023-12-19 01:39:43,432 INFO L226 Difference]: Without dead ends: 2493 [2023-12-19 01:39:43,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2023-12-19 01:39:43,436 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 562 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:43,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 720 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:39:43,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2023-12-19 01:39:43,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2312. [2023-12-19 01:39:43,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2312 states, 1790 states have (on average 1.3983240223463687) internal successors, (2503), 1835 states have internal predecessors, (2503), 297 states have call successors, (297), 185 states have call predecessors, (297), 223 states have return successors, (439), 298 states have call predecessors, (439), 295 states have call successors, (439) [2023-12-19 01:39:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3239 transitions. [2023-12-19 01:39:43,624 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3239 transitions. Word has length 59 [2023-12-19 01:39:43,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:43,624 INFO L495 AbstractCegarLoop]: Abstraction has 2312 states and 3239 transitions. [2023-12-19 01:39:43,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:39:43,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3239 transitions. [2023-12-19 01:39:43,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-19 01:39:43,628 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:43,628 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-19 01:39:43,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 01:39:43,629 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:43,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:43,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1430432035, now seen corresponding path program 1 times [2023-12-19 01:39:43,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:43,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715924423] [2023-12-19 01:39:43,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:43,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:43,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:43,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:43,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:39:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:43,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:39:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:43,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:43,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:39:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:43,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 01:39:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:43,716 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-19 01:39:43,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:43,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715924423] [2023-12-19 01:39:43,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715924423] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:43,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:43,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:39:43,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778987862] [2023-12-19 01:39:43,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:43,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:39:43,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:43,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:39:43,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:43,719 INFO L87 Difference]: Start difference. First operand 2312 states and 3239 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-19 01:39:44,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:44,233 INFO L93 Difference]: Finished difference Result 4034 states and 5598 transitions. [2023-12-19 01:39:44,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 01:39:44,234 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-19 01:39:44,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:44,248 INFO L225 Difference]: With dead ends: 4034 [2023-12-19 01:39:44,248 INFO L226 Difference]: Without dead ends: 3244 [2023-12-19 01:39:44,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-12-19 01:39:44,252 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 660 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:44,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 497 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:39:44,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3244 states. [2023-12-19 01:39:44,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3244 to 3086. [2023-12-19 01:39:44,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3086 states, 2369 states have (on average 1.3748417053609119) internal successors, (3257), 2427 states have internal predecessors, (3257), 401 states have call successors, (401), 249 states have call predecessors, (401), 314 states have return successors, (629), 419 states have call predecessors, (629), 399 states have call successors, (629) [2023-12-19 01:39:44,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 4287 transitions. [2023-12-19 01:39:44,461 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 4287 transitions. Word has length 59 [2023-12-19 01:39:44,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:44,461 INFO L495 AbstractCegarLoop]: Abstraction has 3086 states and 4287 transitions. [2023-12-19 01:39:44,461 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-19 01:39:44,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 4287 transitions. [2023-12-19 01:39:44,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-19 01:39:44,463 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:44,463 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-19 01:39:44,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 01:39:44,463 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:44,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:44,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1175759513, now seen corresponding path program 1 times [2023-12-19 01:39:44,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:44,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292970789] [2023-12-19 01:39:44,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:44,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:44,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:44,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:44,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:39:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:44,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:39:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:44,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:44,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:39:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:44,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 01:39:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:44,507 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-19 01:39:44,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:44,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292970789] [2023-12-19 01:39:44,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292970789] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:44,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:44,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:39:44,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103194898] [2023-12-19 01:39:44,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:44,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:39:44,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:44,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:39:44,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:39:44,508 INFO L87 Difference]: Start difference. First operand 3086 states and 4287 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-19 01:39:44,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:44,890 INFO L93 Difference]: Finished difference Result 4668 states and 6502 transitions. [2023-12-19 01:39:44,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 01:39:44,901 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-19 01:39:44,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:44,907 INFO L225 Difference]: With dead ends: 4668 [2023-12-19 01:39:44,908 INFO L226 Difference]: Without dead ends: 1500 [2023-12-19 01:39:44,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:39:44,915 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 410 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:44,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 441 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:39:44,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2023-12-19 01:39:45,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1500. [2023-12-19 01:39:45,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1169 states have (on average 1.4208725406330196) internal successors, (1661), 1201 states have internal predecessors, (1661), 194 states have call successors, (194), 120 states have call predecessors, (194), 136 states have return successors, (291), 182 states have call predecessors, (291), 194 states have call successors, (291) [2023-12-19 01:39:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 2146 transitions. [2023-12-19 01:39:45,024 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 2146 transitions. Word has length 60 [2023-12-19 01:39:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:45,025 INFO L495 AbstractCegarLoop]: Abstraction has 1500 states and 2146 transitions. [2023-12-19 01:39:45,025 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-19 01:39:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2146 transitions. [2023-12-19 01:39:45,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-19 01:39:45,027 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:45,027 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:45,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 01:39:45,027 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:45,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:45,028 INFO L85 PathProgramCache]: Analyzing trace with hash -254958315, now seen corresponding path program 1 times [2023-12-19 01:39:45,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:45,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739678809] [2023-12-19 01:39:45,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:45,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:39:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:39:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:39:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:39:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-19 01:39:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 01:39:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-19 01:39:45,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:45,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739678809] [2023-12-19 01:39:45,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739678809] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:39:45,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38436643] [2023-12-19 01:39:45,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:45,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:39:45,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:39:45,096 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-19 01:39:45,118 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-19 01:39:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:39:45,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:39:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-19 01:39:45,205 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:39:45,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38436643] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:45,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:39:45,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:39:45,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589107723] [2023-12-19 01:39:45,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:45,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:39:45,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:45,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:39:45,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:45,208 INFO L87 Difference]: Start difference. First operand 1500 states and 2146 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:39:45,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:45,335 INFO L93 Difference]: Finished difference Result 4317 states and 6275 transitions. [2023-12-19 01:39:45,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:39:45,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2023-12-19 01:39:45,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:45,355 INFO L225 Difference]: With dead ends: 4317 [2023-12-19 01:39:45,355 INFO L226 Difference]: Without dead ends: 2827 [2023-12-19 01:39:45,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:45,359 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 107 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:45,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 339 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:39:45,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2023-12-19 01:39:45,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2827. [2023-12-19 01:39:45,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2827 states, 2212 states have (on average 1.4037070524412296) internal successors, (3105), 2261 states have internal predecessors, (3105), 353 states have call successors, (353), 226 states have call predecessors, (353), 261 states have return successors, (590), 347 states have call predecessors, (590), 353 states have call successors, (590) [2023-12-19 01:39:45,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 4048 transitions. [2023-12-19 01:39:45,578 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 4048 transitions. Word has length 83 [2023-12-19 01:39:45,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:45,578 INFO L495 AbstractCegarLoop]: Abstraction has 2827 states and 4048 transitions. [2023-12-19 01:39:45,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:39:45,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 4048 transitions. [2023-12-19 01:39:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-19 01:39:45,582 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:45,583 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:45,591 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-19 01:39:45,789 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,SelfDestructingSolverStorable13 [2023-12-19 01:39:45,789 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:45,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:45,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1397568783, now seen corresponding path program 1 times [2023-12-19 01:39:45,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:45,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027793705] [2023-12-19 01:39:45,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:45,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:39:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:39:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:39:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:39:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-19 01:39:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-19 01:39:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-19 01:39:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,858 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-19 01:39:45,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:45,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027793705] [2023-12-19 01:39:45,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027793705] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:39:45,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013932820] [2023-12-19 01:39:45,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:45,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:39:45,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:39:45,859 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-19 01:39:45,870 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-19 01:39:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:39:45,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:39:46,011 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-19 01:39:46,012 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:39:46,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013932820] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:46,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:39:46,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-19 01:39:46,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613659380] [2023-12-19 01:39:46,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:46,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:39:46,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:46,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:39:46,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:46,015 INFO L87 Difference]: Start difference. First operand 2827 states and 4048 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-19 01:39:46,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:46,208 INFO L93 Difference]: Finished difference Result 6364 states and 9215 transitions. [2023-12-19 01:39:46,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:39:46,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 106 [2023-12-19 01:39:46,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:46,225 INFO L225 Difference]: With dead ends: 6364 [2023-12-19 01:39:46,225 INFO L226 Difference]: Without dead ends: 4225 [2023-12-19 01:39:46,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:46,232 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 67 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:46,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 235 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:39:46,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4225 states. [2023-12-19 01:39:46,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4225 to 4183. [2023-12-19 01:39:46,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4183 states, 3278 states have (on average 1.400549115314216) internal successors, (4591), 3348 states have internal predecessors, (4591), 517 states have call successors, (517), 336 states have call predecessors, (517), 387 states have return successors, (834), 506 states have call predecessors, (834), 517 states have call successors, (834) [2023-12-19 01:39:46,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4183 states to 4183 states and 5942 transitions. [2023-12-19 01:39:46,469 INFO L78 Accepts]: Start accepts. Automaton has 4183 states and 5942 transitions. Word has length 106 [2023-12-19 01:39:46,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:46,469 INFO L495 AbstractCegarLoop]: Abstraction has 4183 states and 5942 transitions. [2023-12-19 01:39:46,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-19 01:39:46,470 INFO L276 IsEmpty]: Start isEmpty. Operand 4183 states and 5942 transitions. [2023-12-19 01:39:46,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-19 01:39:46,476 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:46,476 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:46,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-19 01:39:46,682 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,SelfDestructingSolverStorable14 [2023-12-19 01:39:46,683 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:46,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:46,684 INFO L85 PathProgramCache]: Analyzing trace with hash -687488582, now seen corresponding path program 1 times [2023-12-19 01:39:46,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:46,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509170523] [2023-12-19 01:39:46,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:46,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:46,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:46,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:39:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:46,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:39:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:46,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:39:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:46,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:39:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:46,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 01:39:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:46,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 01:39:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:46,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:46,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 01:39:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:46,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:46,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-19 01:39:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-19 01:39:46,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:46,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509170523] [2023-12-19 01:39:46,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509170523] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:39:46,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640732741] [2023-12-19 01:39:46,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:46,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:39:46,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:39:46,777 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-19 01:39:46,796 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-19 01:39:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:46,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:39:46,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:39:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-19 01:39:46,924 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:39:46,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640732741] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:46,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:39:46,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:39:46,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234216346] [2023-12-19 01:39:46,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:46,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:39:46,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:46,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:39:46,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:46,926 INFO L87 Difference]: Start difference. First operand 4183 states and 5942 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-19 01:39:47,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:47,231 INFO L93 Difference]: Finished difference Result 8759 states and 12689 transitions. [2023-12-19 01:39:47,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:39:47,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 121 [2023-12-19 01:39:47,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:47,251 INFO L225 Difference]: With dead ends: 8759 [2023-12-19 01:39:47,251 INFO L226 Difference]: Without dead ends: 4587 [2023-12-19 01:39:47,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:47,265 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 112 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:47,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 143 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:39:47,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4587 states. [2023-12-19 01:39:47,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4587 to 4492. [2023-12-19 01:39:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4492 states, 3562 states have (on average 1.3329590117911285) internal successors, (4748), 3627 states have internal predecessors, (4748), 513 states have call successors, (513), 362 states have call predecessors, (513), 416 states have return successors, (816), 510 states have call predecessors, (816), 513 states have call successors, (816) [2023-12-19 01:39:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4492 states to 4492 states and 6077 transitions. [2023-12-19 01:39:47,567 INFO L78 Accepts]: Start accepts. Automaton has 4492 states and 6077 transitions. Word has length 121 [2023-12-19 01:39:47,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:47,567 INFO L495 AbstractCegarLoop]: Abstraction has 4492 states and 6077 transitions. [2023-12-19 01:39:47,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-19 01:39:47,567 INFO L276 IsEmpty]: Start isEmpty. Operand 4492 states and 6077 transitions. [2023-12-19 01:39:47,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-19 01:39:47,573 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:47,573 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:47,586 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-19 01:39:47,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:39:47,779 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:47,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:47,780 INFO L85 PathProgramCache]: Analyzing trace with hash -48704103, now seen corresponding path program 2 times [2023-12-19 01:39:47,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:47,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812785153] [2023-12-19 01:39:47,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:47,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:47,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:39:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:47,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:39:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:47,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:39:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:47,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:39:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:47,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 01:39:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:47,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 01:39:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:47,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:47,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 01:39:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:47,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:47,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-19 01:39:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:47,854 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-12-19 01:39:47,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:47,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812785153] [2023-12-19 01:39:47,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812785153] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:39:47,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709106655] [2023-12-19 01:39:47,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 01:39:47,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:39:47,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:39:47,856 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-19 01:39:47,886 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-19 01:39:47,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-19 01:39:47,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 01:39:47,932 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-19 01:39:47,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:39:47,969 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-19 01:39:47,969 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:39:47,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709106655] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:47,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:39:47,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2023-12-19 01:39:47,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299667387] [2023-12-19 01:39:47,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:47,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:39:47,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:47,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:39:47,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:39:47,971 INFO L87 Difference]: Start difference. First operand 4492 states and 6077 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-19 01:39:48,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:48,216 INFO L93 Difference]: Finished difference Result 9011 states and 12512 transitions. [2023-12-19 01:39:48,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:39:48,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 121 [2023-12-19 01:39:48,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:48,226 INFO L225 Difference]: With dead ends: 9011 [2023-12-19 01:39:48,226 INFO L226 Difference]: Without dead ends: 4532 [2023-12-19 01:39:48,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 141 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-19 01:39:48,234 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 2 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:48,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 358 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:39:48,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4532 states. [2023-12-19 01:39:48,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4532 to 4512. [2023-12-19 01:39:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4512 states, 3582 states have (on average 1.3101619207146846) internal successors, (4693), 3647 states have internal predecessors, (4693), 513 states have call successors, (513), 362 states have call predecessors, (513), 416 states have return successors, (816), 510 states have call predecessors, (816), 513 states have call successors, (816) [2023-12-19 01:39:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4512 states to 4512 states and 6022 transitions. [2023-12-19 01:39:48,500 INFO L78 Accepts]: Start accepts. Automaton has 4512 states and 6022 transitions. Word has length 121 [2023-12-19 01:39:48,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:48,501 INFO L495 AbstractCegarLoop]: Abstraction has 4512 states and 6022 transitions. [2023-12-19 01:39:48,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-19 01:39:48,501 INFO L276 IsEmpty]: Start isEmpty. Operand 4512 states and 6022 transitions. [2023-12-19 01:39:48,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-19 01:39:48,507 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:48,507 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] [2023-12-19 01:39:48,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-19 01:39:48,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-19 01:39:48,728 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:48,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:48,729 INFO L85 PathProgramCache]: Analyzing trace with hash -502757219, now seen corresponding path program 1 times [2023-12-19 01:39:48,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:48,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396129906] [2023-12-19 01:39:48,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:48,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:48,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:48,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:39:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:48,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:39:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:48,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:39:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:48,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:39:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:48,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 01:39:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:48,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 01:39:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:48,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:48,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 01:39:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:48,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:48,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-19 01:39:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-19 01:39:48,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:48,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396129906] [2023-12-19 01:39:48,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396129906] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:48,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:48,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 01:39:48,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158112138] [2023-12-19 01:39:48,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:48,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 01:39:48,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:48,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 01:39:48,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:39:48,876 INFO L87 Difference]: Start difference. First operand 4512 states and 6022 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-19 01:39:49,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:49,641 INFO L93 Difference]: Finished difference Result 7264 states and 9616 transitions. [2023-12-19 01:39:49,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 01:39:49,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 121 [2023-12-19 01:39:49,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:49,655 INFO L225 Difference]: With dead ends: 7264 [2023-12-19 01:39:49,655 INFO L226 Difference]: Without dead ends: 4457 [2023-12-19 01:39:49,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-12-19 01:39:49,661 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 338 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:49,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 334 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:39:49,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4457 states. [2023-12-19 01:39:49,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4457 to 3771. [2023-12-19 01:39:49,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3771 states, 2996 states have (on average 1.2880507343124166) internal successors, (3859), 3058 states have internal predecessors, (3859), 419 states have call successors, (419), 292 states have call predecessors, (419), 355 states have return successors, (687), 424 states have call predecessors, (687), 419 states have call successors, (687) [2023-12-19 01:39:49,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3771 states to 3771 states and 4965 transitions. [2023-12-19 01:39:49,828 INFO L78 Accepts]: Start accepts. Automaton has 3771 states and 4965 transitions. Word has length 121 [2023-12-19 01:39:49,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:49,828 INFO L495 AbstractCegarLoop]: Abstraction has 3771 states and 4965 transitions. [2023-12-19 01:39:49,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-19 01:39:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3771 states and 4965 transitions. [2023-12-19 01:39:49,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-19 01:39:49,832 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:49,832 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] [2023-12-19 01:39:49,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-19 01:39:49,832 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:49,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:49,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1374306011, now seen corresponding path program 1 times [2023-12-19 01:39:49,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:49,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576022574] [2023-12-19 01:39:49,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:49,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:49,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:49,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:39:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:49,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:39:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:49,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:39:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:49,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:39:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:49,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 01:39:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:49,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 01:39:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:49,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:49,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 01:39:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:49,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:49,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-19 01:39:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:49,951 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-19 01:39:49,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:49,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576022574] [2023-12-19 01:39:49,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576022574] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:49,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:49,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 01:39:49,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186670704] [2023-12-19 01:39:49,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:49,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 01:39:49,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:49,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 01:39:49,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:39:49,953 INFO L87 Difference]: Start difference. First operand 3771 states and 4965 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-19 01:39:50,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:50,633 INFO L93 Difference]: Finished difference Result 6913 states and 9082 transitions. [2023-12-19 01:39:50,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 01:39:50,633 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 121 [2023-12-19 01:39:50,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:50,644 INFO L225 Difference]: With dead ends: 6913 [2023-12-19 01:39:50,644 INFO L226 Difference]: Without dead ends: 4016 [2023-12-19 01:39:50,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2023-12-19 01:39:50,652 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 331 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:50,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 353 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:39:50,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2023-12-19 01:39:50,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 3306. [2023-12-19 01:39:50,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3306 states, 2630 states have (on average 1.2927756653992395) internal successors, (3400), 2675 states have internal predecessors, (3400), 371 states have call successors, (371), 256 states have call predecessors, (371), 304 states have return successors, (601), 376 states have call predecessors, (601), 371 states have call successors, (601) [2023-12-19 01:39:50,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 4372 transitions. [2023-12-19 01:39:50,836 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 4372 transitions. Word has length 121 [2023-12-19 01:39:50,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:50,836 INFO L495 AbstractCegarLoop]: Abstraction has 3306 states and 4372 transitions. [2023-12-19 01:39:50,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-19 01:39:50,836 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 4372 transitions. [2023-12-19 01:39:50,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-19 01:39:50,839 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:50,839 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] [2023-12-19 01:39:50,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-19 01:39:50,839 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:50,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:50,840 INFO L85 PathProgramCache]: Analyzing trace with hash 603572445, now seen corresponding path program 1 times [2023-12-19 01:39:50,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:50,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085962969] [2023-12-19 01:39:50,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:50,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:39:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:39:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:39:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:39:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 01:39:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 01:39:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 01:39:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-19 01:39:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,903 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-12-19 01:39:50,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:50,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085962969] [2023-12-19 01:39:50,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085962969] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:39:50,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430613642] [2023-12-19 01:39:50,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:50,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:39:50,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:39:50,905 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-19 01:39:50,913 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-19 01:39:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:39:50,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:39:51,012 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-19 01:39:51,013 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:39:51,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430613642] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:51,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:39:51,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2023-12-19 01:39:51,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510173481] [2023-12-19 01:39:51,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:51,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:39:51,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:51,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:39:51,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:39:51,015 INFO L87 Difference]: Start difference. First operand 3306 states and 4372 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-19 01:39:51,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:51,166 INFO L93 Difference]: Finished difference Result 6579 states and 8730 transitions. [2023-12-19 01:39:51,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:39:51,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 121 [2023-12-19 01:39:51,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:51,201 INFO L225 Difference]: With dead ends: 6579 [2023-12-19 01:39:51,201 INFO L226 Difference]: Without dead ends: 3469 [2023-12-19 01:39:51,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:39:51,206 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 92 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:51,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 251 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:39:51,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3469 states. [2023-12-19 01:39:51,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3469 to 3285. [2023-12-19 01:39:51,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3285 states, 2609 states have (on average 1.2709850517439631) internal successors, (3316), 2654 states have internal predecessors, (3316), 371 states have call successors, (371), 256 states have call predecessors, (371), 304 states have return successors, (601), 376 states have call predecessors, (601), 371 states have call successors, (601) [2023-12-19 01:39:51,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3285 states to 3285 states and 4288 transitions. [2023-12-19 01:39:51,364 INFO L78 Accepts]: Start accepts. Automaton has 3285 states and 4288 transitions. Word has length 121 [2023-12-19 01:39:51,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:51,364 INFO L495 AbstractCegarLoop]: Abstraction has 3285 states and 4288 transitions. [2023-12-19 01:39:51,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-19 01:39:51,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3285 states and 4288 transitions. [2023-12-19 01:39:51,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-19 01:39:51,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:51,367 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:51,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-19 01:39:51,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:39:51,573 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:51,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:51,574 INFO L85 PathProgramCache]: Analyzing trace with hash 718626576, now seen corresponding path program 1 times [2023-12-19 01:39:51,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:51,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701532693] [2023-12-19 01:39:51,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:51,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:51,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:51,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:39:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:51,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:39:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:51,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:39:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:51,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:39:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:51,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-19 01:39:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:51,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:51,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 01:39:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:51,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-19 01:39:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:51,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:51,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-19 01:39:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-19 01:39:51,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:51,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701532693] [2023-12-19 01:39:51,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701532693] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:39:51,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575605162] [2023-12-19 01:39:51,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:51,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:39:51,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:39:51,671 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-19 01:39:51,673 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-19 01:39:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:51,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:39:51,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:39:51,771 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-19 01:39:51,771 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:39:51,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575605162] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:51,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:39:51,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-12-19 01:39:51,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293700149] [2023-12-19 01:39:51,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:51,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:39:51,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:51,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:39:51,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:39:51,774 INFO L87 Difference]: Start difference. First operand 3285 states and 4288 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:39:52,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:52,092 INFO L93 Difference]: Finished difference Result 9587 states and 12512 transitions. [2023-12-19 01:39:52,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:39:52,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 122 [2023-12-19 01:39:52,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:52,108 INFO L225 Difference]: With dead ends: 9587 [2023-12-19 01:39:52,109 INFO L226 Difference]: Without dead ends: 6317 [2023-12-19 01:39:52,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:39:52,115 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 105 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:52,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 320 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:39:52,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6317 states. [2023-12-19 01:39:52,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6317 to 5827. [2023-12-19 01:39:52,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5827 states, 4632 states have (on average 1.2538860103626943) internal successors, (5808), 4716 states have internal predecessors, (5808), 659 states have call successors, (659), 460 states have call predecessors, (659), 535 states have return successors, (1019), 654 states have call predecessors, (1019), 659 states have call successors, (1019) [2023-12-19 01:39:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5827 states to 5827 states and 7486 transitions. [2023-12-19 01:39:52,464 INFO L78 Accepts]: Start accepts. Automaton has 5827 states and 7486 transitions. Word has length 122 [2023-12-19 01:39:52,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:52,465 INFO L495 AbstractCegarLoop]: Abstraction has 5827 states and 7486 transitions. [2023-12-19 01:39:52,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:39:52,465 INFO L276 IsEmpty]: Start isEmpty. Operand 5827 states and 7486 transitions. [2023-12-19 01:39:52,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-19 01:39:52,469 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:52,469 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:52,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-19 01:39:52,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:39:52,677 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:52,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:52,677 INFO L85 PathProgramCache]: Analyzing trace with hash -450238612, now seen corresponding path program 1 times [2023-12-19 01:39:52,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:52,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625834001] [2023-12-19 01:39:52,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:52,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:39:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:39:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:39:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:39:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-19 01:39:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:39:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 01:39:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 01:39:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,757 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-19 01:39:52,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:52,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625834001] [2023-12-19 01:39:52,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625834001] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:39:52,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58011864] [2023-12-19 01:39:52,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:52,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:39:52,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:39:52,758 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-19 01:39:52,780 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-19 01:39:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:39:52,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:39:52,892 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-19 01:39:52,892 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:39:52,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58011864] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:52,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:39:52,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2023-12-19 01:39:52,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870455818] [2023-12-19 01:39:52,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:52,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:39:52,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:52,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:39:52,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:39:52,894 INFO L87 Difference]: Start difference. First operand 5827 states and 7486 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:39:53,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:53,186 INFO L93 Difference]: Finished difference Result 8479 states and 11186 transitions. [2023-12-19 01:39:53,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:39:53,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2023-12-19 01:39:53,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:53,203 INFO L225 Difference]: With dead ends: 8479 [2023-12-19 01:39:53,203 INFO L226 Difference]: Without dead ends: 5363 [2023-12-19 01:39:53,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 145 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-19 01:39:53,211 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 73 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:53,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 312 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:39:53,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5363 states. [2023-12-19 01:39:53,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5363 to 5297. [2023-12-19 01:39:53,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5297 states, 4215 states have (on average 1.231079478054567) internal successors, (5189), 4293 states have internal predecessors, (5189), 601 states have call successors, (601), 420 states have call predecessors, (601), 480 states have return successors, (885), 587 states have call predecessors, (885), 601 states have call successors, (885) [2023-12-19 01:39:53,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5297 states to 5297 states and 6675 transitions. [2023-12-19 01:39:53,457 INFO L78 Accepts]: Start accepts. Automaton has 5297 states and 6675 transitions. Word has length 123 [2023-12-19 01:39:53,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:53,458 INFO L495 AbstractCegarLoop]: Abstraction has 5297 states and 6675 transitions. [2023-12-19 01:39:53,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:39:53,458 INFO L276 IsEmpty]: Start isEmpty. Operand 5297 states and 6675 transitions. [2023-12-19 01:39:53,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-19 01:39:53,461 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:53,461 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:53,476 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-19 01:39:53,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:39:53,668 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:53,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:53,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1360454050, now seen corresponding path program 1 times [2023-12-19 01:39:53,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:53,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78651397] [2023-12-19 01:39:53,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:53,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:53,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:53,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:39:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:53,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:39:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:53,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:39:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:53,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:39:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:53,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-19 01:39:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:53,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:39:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:53,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:53,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 01:39:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:53,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:53,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:39:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-19 01:39:53,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:53,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78651397] [2023-12-19 01:39:53,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78651397] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:39:53,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86304565] [2023-12-19 01:39:53,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:53,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:39:53,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:39:53,775 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-19 01:39:53,788 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-19 01:39:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:53,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-19 01:39:53,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:39:53,862 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-19 01:39:53,862 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:39:53,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86304565] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:53,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:39:53,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-19 01:39:53,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291755488] [2023-12-19 01:39:53,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:53,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:39:53,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:53,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:39:53,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:39:53,864 INFO L87 Difference]: Start difference. First operand 5297 states and 6675 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-19 01:39:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:54,116 INFO L93 Difference]: Finished difference Result 10269 states and 13171 transitions. [2023-12-19 01:39:54,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:39:54,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 124 [2023-12-19 01:39:54,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:54,125 INFO L225 Difference]: With dead ends: 10269 [2023-12-19 01:39:54,125 INFO L226 Difference]: Without dead ends: 4117 [2023-12-19 01:39:54,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:39:54,134 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 11 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:54,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 358 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:39:54,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2023-12-19 01:39:54,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 3995. [2023-12-19 01:39:54,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3995 states, 3203 states have (on average 1.2182329066500157) internal successors, (3902), 3253 states have internal predecessors, (3902), 443 states have call successors, (443), 317 states have call predecessors, (443), 348 states have return successors, (581), 426 states have call predecessors, (581), 443 states have call successors, (581) [2023-12-19 01:39:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3995 states to 3995 states and 4926 transitions. [2023-12-19 01:39:54,312 INFO L78 Accepts]: Start accepts. Automaton has 3995 states and 4926 transitions. Word has length 124 [2023-12-19 01:39:54,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:54,313 INFO L495 AbstractCegarLoop]: Abstraction has 3995 states and 4926 transitions. [2023-12-19 01:39:54,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-19 01:39:54,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3995 states and 4926 transitions. [2023-12-19 01:39:54,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-19 01:39:54,315 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:54,315 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:54,332 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-19 01:39:54,521 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,SelfDestructingSolverStorable22 [2023-12-19 01:39:54,522 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:54,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:54,522 INFO L85 PathProgramCache]: Analyzing trace with hash 865400034, now seen corresponding path program 1 times [2023-12-19 01:39:54,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:54,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822639763] [2023-12-19 01:39:54,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:54,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:54,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:54,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:39:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:54,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:39:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:54,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:39:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:54,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:39:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:54,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-19 01:39:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:54,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:39:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:54,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:54,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 01:39:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:54,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:54,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:39:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-19 01:39:54,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:54,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822639763] [2023-12-19 01:39:54,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822639763] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:54,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:54,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:39:54,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509482062] [2023-12-19 01:39:54,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:54,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:39:54,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:54,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:39:54,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:39:54,644 INFO L87 Difference]: Start difference. First operand 3995 states and 4926 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-19 01:39:55,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:55,224 INFO L93 Difference]: Finished difference Result 8449 states and 10385 transitions. [2023-12-19 01:39:55,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 01:39:55,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 124 [2023-12-19 01:39:55,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:55,247 INFO L225 Difference]: With dead ends: 8449 [2023-12-19 01:39:55,248 INFO L226 Difference]: Without dead ends: 4944 [2023-12-19 01:39:55,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-19 01:39:55,261 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 384 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:55,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 349 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:39:55,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2023-12-19 01:39:55,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4429. [2023-12-19 01:39:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4429 states, 3562 states have (on average 1.2139247613700168) internal successors, (4324), 3611 states have internal predecessors, (4324), 475 states have call successors, (475), 337 states have call predecessors, (475), 391 states have return successors, (610), 482 states have call predecessors, (610), 475 states have call successors, (610) [2023-12-19 01:39:55,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4429 states to 4429 states and 5409 transitions. [2023-12-19 01:39:55,748 INFO L78 Accepts]: Start accepts. Automaton has 4429 states and 5409 transitions. Word has length 124 [2023-12-19 01:39:55,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:55,749 INFO L495 AbstractCegarLoop]: Abstraction has 4429 states and 5409 transitions. [2023-12-19 01:39:55,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-19 01:39:55,749 INFO L276 IsEmpty]: Start isEmpty. Operand 4429 states and 5409 transitions. [2023-12-19 01:39:55,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-19 01:39:55,753 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:55,754 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:39:55,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-19 01:39:55,754 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:55,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:55,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1490897935, now seen corresponding path program 1 times [2023-12-19 01:39:55,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:55,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275505620] [2023-12-19 01:39:55,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:55,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:39:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:39:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:39:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:39:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-19 01:39:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 01:39:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:39:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 01:39:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 01:39:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-19 01:39:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 01:39:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-19 01:39:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-19 01:39:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,935 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-19 01:39:55,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:55,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275505620] [2023-12-19 01:39:55,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275505620] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:39:55,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351264032] [2023-12-19 01:39:55,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:55,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:39:55,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:39:55,939 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-19 01:39:55,952 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-19 01:39:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:56,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:39:56,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:39:56,054 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-19 01:39:56,054 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:39:56,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351264032] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:56,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:39:56,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-12-19 01:39:56,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840937465] [2023-12-19 01:39:56,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:56,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:39:56,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:56,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:39:56,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:39:56,055 INFO L87 Difference]: Start difference. First operand 4429 states and 5409 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2023-12-19 01:39:56,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:56,402 INFO L93 Difference]: Finished difference Result 9715 states and 11926 transitions. [2023-12-19 01:39:56,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:39:56,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 142 [2023-12-19 01:39:56,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:56,415 INFO L225 Difference]: With dead ends: 9715 [2023-12-19 01:39:56,415 INFO L226 Difference]: Without dead ends: 6120 [2023-12-19 01:39:56,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:39:56,420 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 116 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:56,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 279 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:39:56,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6120 states. [2023-12-19 01:39:56,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6120 to 6117. [2023-12-19 01:39:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6117 states, 4913 states have (on average 1.2116832892326481) internal successors, (5953), 4976 states have internal predecessors, (5953), 664 states have call successors, (664), 471 states have call predecessors, (664), 539 states have return successors, (862), 671 states have call predecessors, (862), 664 states have call successors, (862) [2023-12-19 01:39:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6117 states to 6117 states and 7479 transitions. [2023-12-19 01:39:56,881 INFO L78 Accepts]: Start accepts. Automaton has 6117 states and 7479 transitions. Word has length 142 [2023-12-19 01:39:56,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:56,882 INFO L495 AbstractCegarLoop]: Abstraction has 6117 states and 7479 transitions. [2023-12-19 01:39:56,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2023-12-19 01:39:56,882 INFO L276 IsEmpty]: Start isEmpty. Operand 6117 states and 7479 transitions. [2023-12-19 01:39:56,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-19 01:39:56,886 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:56,886 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:39:56,892 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-19 01:39:57,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-19 01:39:57,092 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:57,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:57,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1983524109, now seen corresponding path program 1 times [2023-12-19 01:39:57,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:57,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147853245] [2023-12-19 01:39:57,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:57,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:57,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:57,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:39:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:57,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:39:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:57,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:39:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:57,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:39:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:57,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-19 01:39:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:57,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:57,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 01:39:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:57,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:39:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:57,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 01:39:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:57,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 01:39:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:57,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-19 01:39:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:57,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 01:39:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:57,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-19 01:39:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:57,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-19 01:39:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:57,227 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-19 01:39:57,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:57,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147853245] [2023-12-19 01:39:57,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147853245] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:39:57,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113343557] [2023-12-19 01:39:57,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:57,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:39:57,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:39:57,228 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-19 01:39:57,280 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-19 01:39:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:57,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-19 01:39:57,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:39:57,457 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-19 01:39:57,458 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:39:57,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113343557] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:57,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:39:57,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2023-12-19 01:39:57,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954585114] [2023-12-19 01:39:57,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:57,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:39:57,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:57,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:39:57,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:39:57,459 INFO L87 Difference]: Start difference. First operand 6117 states and 7479 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 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-19 01:39:57,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:57,702 INFO L93 Difference]: Finished difference Result 9036 states and 11156 transitions. [2023-12-19 01:39:57,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 01:39:57,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 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 142 [2023-12-19 01:39:57,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:57,703 INFO L225 Difference]: With dead ends: 9036 [2023-12-19 01:39:57,703 INFO L226 Difference]: Without dead ends: 0 [2023-12-19 01:39:57,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:39:57,713 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 104 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:57,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 121 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 01:39:57,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-19 01:39:57,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-19 01:39:57,714 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-19 01:39:57,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-19 01:39:57,716 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2023-12-19 01:39:57,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:57,716 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-19 01:39:57,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 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-19 01:39:57,716 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-19 01:39:57,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-19 01:39:57,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-19 01:39:57,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-19 01:39:57,726 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-19 01:39:57,925 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,SelfDestructingSolverStorable25 [2023-12-19 01:39:57,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-19 01:40:45,162 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 915 925) no Hoare annotation was computed. [2023-12-19 01:40:45,162 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 915 925) no Hoare annotation was computed. [2023-12-19 01:40:45,163 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 915 925) the Hoare annotation is: (let ((.cse8 (< ~E_M~0 2)) (.cse9 (not (= ~token~0 ~local~0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse5 (< |old(~m_st~0)| 2)) (.cse6 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse7 (< ~E_1~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 (= |old(~t1_st~0)| 0) .cse4 .cse5 .cse6 .cse7 (not (= (+ ~local~0 1) ~token~0))) (or .cse0 (< 0 ~t1_pc~0) .cse1 .cse8 .cse3 .cse4 (= ~m_pc~0 1) .cse6 .cse9) (or .cse0 .cse1 (< |old(~t1_st~0)| 2) .cse2 .cse8 .cse3 .cse4 .cse6 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2))))) [2023-12-19 01:40:45,163 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 262 276) no Hoare annotation was computed. [2023-12-19 01:40:45,163 INFO L899 garLoopResultBuilder]: For program point L49-1(lines 49 53) no Hoare annotation was computed. [2023-12-19 01:40:45,163 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 48) no Hoare annotation was computed. [2023-12-19 01:40:45,163 INFO L899 garLoopResultBuilder]: For program point L44-2(lines 43 58) no Hoare annotation was computed. [2023-12-19 01:40:45,163 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 262 276) the Hoare annotation is: (let ((.cse4 (not (= ~p_dw_pc~0 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse5 (= ~m_pc~0 1)) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (< ~p_dw_pc~0 1)) (.cse7 (not (= ~c_dr_pc~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse6) (or .cse0 .cse1 .cse2 (not (= ~c_dr_pc~0 0)) .cse3 .cse5 .cse6 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse7))) [2023-12-19 01:40:45,163 INFO L899 garLoopResultBuilder]: For program point L266-1(lines 262 276) no Hoare annotation was computed. [2023-12-19 01:40:45,163 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 709) no Hoare annotation was computed. [2023-12-19 01:40:45,163 INFO L899 garLoopResultBuilder]: For program point L898-2(lines 898 902) no Hoare annotation was computed. [2023-12-19 01:40:45,163 INFO L899 garLoopResultBuilder]: For program point L733(lines 721 735) no Hoare annotation was computed. [2023-12-19 01:40:45,163 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 728) no Hoare annotation was computed. [2023-12-19 01:40:45,164 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 890 914) the Hoare annotation is: (let ((.cse11 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse14 (not (= (+ ~local~0 1) ~token~0))) (.cse1 (< 0 ~t1_pc~0)) (.cse5 (= ~m_pc~0 1)) (.cse12 (< |old(~t1_st~0)| 2)) (.cse9 (< ~E_M~0 2)) (.cse10 (not (= ~token~0 ~local~0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse2 (and .cse11 (= ~m_st~0 |old(~m_st~0)|))) (.cse13 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse6 (< |old(~m_st~0)| 2)) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse8 (< ~E_1~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10) (or (and .cse11 (= ~m_st~0 0)) .cse0 .cse12 .cse13 .cse9 .cse3 .cse4 .cse7 (not (= |old(~m_st~0)| 0)) .cse8 .cse14) (or .cse0 .cse2 .cse13 .cse3 (= |old(~t1_st~0)| 0) .cse4 .cse6 .cse7 .cse8 .cse14) (or .cse0 .cse2 .cse13 .cse9 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse7 .cse10) (or .cse0 .cse2 .cse12 .cse13 .cse9 .cse3 .cse4 .cse7 .cse10) (or .cse0 .cse2 .cse13 .cse3 .cse4 .cse6 .cse7 .cse8 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2)))))) [2023-12-19 01:40:45,164 INFO L899 garLoopResultBuilder]: For program point L703(lines 703 712) no Hoare annotation was computed. [2023-12-19 01:40:45,164 INFO L899 garLoopResultBuilder]: For program point L703-2(lines 703 712) no Hoare annotation was computed. [2023-12-19 01:40:45,164 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 890 914) no Hoare annotation was computed. [2023-12-19 01:40:45,164 INFO L899 garLoopResultBuilder]: For program point L722(lines 722 731) no Hoare annotation was computed. [2023-12-19 01:40:45,164 INFO L899 garLoopResultBuilder]: For program point L722-2(lines 722 731) no Hoare annotation was computed. [2023-12-19 01:40:45,164 INFO L899 garLoopResultBuilder]: For program point L714(lines 702 716) no Hoare annotation was computed. [2023-12-19 01:40:45,164 INFO L899 garLoopResultBuilder]: For program point L906(lines 906 910) no Hoare annotation was computed. [2023-12-19 01:40:45,164 INFO L899 garLoopResultBuilder]: For program point L906-2(lines 890 914) no Hoare annotation was computed. [2023-12-19 01:40:45,164 INFO L899 garLoopResultBuilder]: For program point L898(lines 898 902) no Hoare annotation was computed. [2023-12-19 01:40:45,164 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 387 411) no Hoare annotation was computed. [2023-12-19 01:40:45,164 INFO L899 garLoopResultBuilder]: For program point L403(lines 403 407) no Hoare annotation was computed. [2023-12-19 01:40:45,164 INFO L899 garLoopResultBuilder]: For program point L401(line 401) no Hoare annotation was computed. [2023-12-19 01:40:45,164 INFO L899 garLoopResultBuilder]: For program point L403-2(lines 387 411) no Hoare annotation was computed. [2023-12-19 01:40:45,164 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2023-12-19 01:40:45,164 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 387 411) the Hoare annotation is: (let ((.cse7 (< ~p_dw_pc~0 1)) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse5 (= ~m_pc~0 1)) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (= ~c_dr_pc~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 (not (= ~c_dr_pc~0 0)) .cse2 .cse3 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8))) [2023-12-19 01:40:45,165 INFO L895 garLoopResultBuilder]: At program point L393(line 393) the Hoare annotation is: (let ((.cse7 (< ~p_dw_pc~0 1)) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse5 (= ~m_pc~0 1)) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (= ~c_dr_pc~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 (not (= ~c_dr_pc~0 0)) .cse2 .cse3 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8))) [2023-12-19 01:40:45,165 INFO L895 garLoopResultBuilder]: At program point L395-2(lines 395 399) the Hoare annotation is: (let ((.cse8 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse3 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse11 (not (= ~p_dw_pc~0 0))) (.cse13 (and .cse8 (= activate_threads1_~tmp~1 0) .cse3)) (.cse9 (= ~p_dw_pc~0 1)) (.cse12 (not (= ~c_dr_pc~0 1))) (.cse10 (not (= ~q_read_ev~0 2))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse14 (and .cse8 .cse3)) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse5 (= ~m_pc~0 1)) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse7 (< ~p_dw_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |old(~p_dw_st~0)| 0))) (or .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse9 .cse6 .cse7 .cse10) (or .cse0 .cse1 .cse4 .cse11 .cse5 .cse6 .cse12 .cse13) (or .cse0 .cse1 .cse4 .cse11 .cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse6 .cse13) (or .cse0 .cse1 .cse14 .cse4 .cse5 .cse9 .cse6 .cse7 .cse12 .cse10) (or .cse0 .cse1 .cse2 .cse14 .cse4 .cse5 (= ~p_dw_st~0 0) .cse6 .cse7)))) [2023-12-19 01:40:45,165 INFO L899 garLoopResultBuilder]: For program point L393-1(line 393) no Hoare annotation was computed. [2023-12-19 01:40:45,165 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 737 744) no Hoare annotation was computed. [2023-12-19 01:40:45,165 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 737 744) the Hoare annotation is: true [2023-12-19 01:40:45,165 INFO L899 garLoopResultBuilder]: For program point L853-1(lines 834 861) no Hoare annotation was computed. [2023-12-19 01:40:45,165 INFO L899 garLoopResultBuilder]: For program point L848-1(lines 837 860) no Hoare annotation was computed. [2023-12-19 01:40:45,165 INFO L899 garLoopResultBuilder]: For program point L843-1(lines 837 860) no Hoare annotation was computed. [2023-12-19 01:40:45,166 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 834 861) the Hoare annotation is: (let ((.cse9 (not (= ~token~0 ~local~0))) (.cse10 (< 0 ~t1_pc~0)) (.cse13 (= ~m_pc~0 1)) (.cse11 (not (= ~m_st~0 0))) (.cse12 (< ~t1_st~0 2)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (< ~m_st~0 2)) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse5 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse6 (< |old(~E_1~0)| 2)) (.cse7 (< |old(~E_M~0)| 2)) (.cse8 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (not (= (+ ~local~0 1) ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse9) (or .cse0 .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse12 .cse0 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6 .cse7 .cse8 .cse11 .cse9) (or .cse0 .cse10 .cse1 .cse3 .cse4 .cse13 .cse5 .cse6 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2))) (or .cse12 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse14) (or .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14))) [2023-12-19 01:40:45,166 INFO L899 garLoopResultBuilder]: For program point L838-1(lines 837 860) no Hoare annotation was computed. [2023-12-19 01:40:45,166 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 834 861) no Hoare annotation was computed. [2023-12-19 01:40:45,166 INFO L899 garLoopResultBuilder]: For program point L319-1(lines 318 331) no Hoare annotation was computed. [2023-12-19 01:40:45,166 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 315 332) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_pc~0 1))) (.cse3 (not (= ~p_dw_pc~0 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~E_M~0 ~M_E~0))) (.cse4 (= ~m_pc~0 1)) (.cse5 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (< ~p_dw_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse6) (or .cse0 .cse1 (not (= ~c_dr_pc~0 0)) .cse2 .cse4 .cse5 .cse6 .cse8))) [2023-12-19 01:40:45,166 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 315 332) no Hoare annotation was computed. [2023-12-19 01:40:45,166 INFO L899 garLoopResultBuilder]: For program point L324-1(lines 315 332) no Hoare annotation was computed. [2023-12-19 01:40:45,166 INFO L899 garLoopResultBuilder]: For program point L124(lines 102 126) no Hoare annotation was computed. [2023-12-19 01:40:45,166 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2023-12-19 01:40:45,166 INFO L899 garLoopResultBuilder]: For program point L113-1(lines 113 122) no Hoare annotation was computed. [2023-12-19 01:40:45,167 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 99 127) the Hoare annotation is: true [2023-12-19 01:40:45,167 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 109) no Hoare annotation was computed. [2023-12-19 01:40:45,167 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 99 127) no Hoare annotation was computed. [2023-12-19 01:40:45,167 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 112) no Hoare annotation was computed. [2023-12-19 01:40:45,167 INFO L899 garLoopResultBuilder]: For program point L103-2(lines 102 126) no Hoare annotation was computed. [2023-12-19 01:40:45,167 INFO L899 garLoopResultBuilder]: For program point L1026-2(lines 1026 1035) no Hoare annotation was computed. [2023-12-19 01:40:45,167 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2023-12-19 01:40:45,167 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 439) no Hoare annotation was computed. [2023-12-19 01:40:45,167 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 153 201) no Hoare annotation was computed. [2023-12-19 01:40:45,167 INFO L895 garLoopResultBuilder]: At program point L499-1(lines 499 536) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 1)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse8 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6))) [2023-12-19 01:40:45,167 INFO L899 garLoopResultBuilder]: For program point L599(line 599) no Hoare annotation was computed. [2023-12-19 01:40:45,167 INFO L899 garLoopResultBuilder]: For program point L1063(lines 1063 1069) no Hoare annotation was computed. [2023-12-19 01:40:45,168 INFO L895 garLoopResultBuilder]: At program point L1030(line 1030) the Hoare annotation is: (let ((.cse12 (= (+ ~local~0 1) ~token~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~t1_st~0)) (.cse13 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse13 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse4 .cse6 .cse7) (and .cse0 .cse1 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse2 .cse13 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse8 .cse2 .cse13 .cse3 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse2 .cse4 .cse6 .cse7 .cse9))) [2023-12-19 01:40:45,168 INFO L899 garLoopResultBuilder]: For program point L1030-1(line 1030) no Hoare annotation was computed. [2023-12-19 01:40:45,168 INFO L899 garLoopResultBuilder]: For program point transmit1_returnLabel#1(lines 663 698) no Hoare annotation was computed. [2023-12-19 01:40:45,168 INFO L899 garLoopResultBuilder]: For program point L799-1(lines 789 827) no Hoare annotation was computed. [2023-12-19 01:40:45,168 INFO L899 garLoopResultBuilder]: For program point L667(lines 667 675) no Hoare annotation was computed. [2023-12-19 01:40:45,168 INFO L895 garLoopResultBuilder]: At program point L172-1(lines 172 195) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~E_M~0 2)) (.cse5 (= ~M_E~0 2))) (or (and (= ~p_dw_pc~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 (<= 1 ~p_dw_pc~0) .cse4 .cse5))))) (or (and (= ~c_dr_pc~0 0) .cse0) (and (= ~c_dr_pc~0 1) .cse0))) [2023-12-19 01:40:45,168 INFO L899 garLoopResultBuilder]: For program point start_simulation2_returnLabel#1(lines 992 1050) no Hoare annotation was computed. [2023-12-19 01:40:45,168 INFO L899 garLoopResultBuilder]: For program point L1065(lines 1065 1068) no Hoare annotation was computed. [2023-12-19 01:40:45,168 INFO L899 garLoopResultBuilder]: For program point master_returnLabel#1(lines 619 662) no Hoare annotation was computed. [2023-12-19 01:40:45,168 INFO L895 garLoopResultBuilder]: At program point L471(line 471) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 1)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse8 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6))) [2023-12-19 01:40:45,168 INFO L899 garLoopResultBuilder]: For program point L471-1(line 471) no Hoare annotation was computed. [2023-12-19 01:40:45,168 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2023-12-19 01:40:45,169 INFO L895 garLoopResultBuilder]: At program point L1000(line 1000) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (<= 2 ~E_1~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (<= ~t1_pc~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2023-12-19 01:40:45,169 INFO L899 garLoopResultBuilder]: For program point L1000-1(line 1000) no Hoare annotation was computed. [2023-12-19 01:40:45,169 INFO L899 garLoopResultBuilder]: For program point L802(lines 802 809) no Hoare annotation was computed. [2023-12-19 01:40:45,169 INFO L899 garLoopResultBuilder]: For program point L802-2(lines 802 809) no Hoare annotation was computed. [2023-12-19 01:40:45,169 INFO L899 garLoopResultBuilder]: For program point L670(lines 670 674) no Hoare annotation was computed. [2023-12-19 01:40:45,169 INFO L899 garLoopResultBuilder]: For program point start_simulation1_returnLabel#1(lines 484 542) no Hoare annotation was computed. [2023-12-19 01:40:45,169 INFO L899 garLoopResultBuilder]: For program point L373(lines 373 377) no Hoare annotation was computed. [2023-12-19 01:40:45,169 INFO L899 garLoopResultBuilder]: For program point L373-2(lines 372 385) no Hoare annotation was computed. [2023-12-19 01:40:45,169 INFO L899 garLoopResultBuilder]: For program point L473(lines 473 478) no Hoare annotation was computed. [2023-12-19 01:40:45,169 INFO L899 garLoopResultBuilder]: For program point L242(lines 242 254) no Hoare annotation was computed. [2023-12-19 01:40:45,169 INFO L895 garLoopResultBuilder]: At program point L1002(line 1002) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~m_st~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_st~0 0) .cse5 .cse6 .cse7 .cse8 (= ~token~0 ~local~0) .cse9))) [2023-12-19 01:40:45,169 INFO L895 garLoopResultBuilder]: At program point L1002-1(line 1002) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~m_st~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_st~0 0) .cse5 .cse6 .cse7 .cse8 (= ~token~0 ~local~0) .cse9))) [2023-12-19 01:40:45,169 INFO L899 garLoopResultBuilder]: For program point eval2_returnLabel#1(lines 783 833) no Hoare annotation was computed. [2023-12-19 01:40:45,169 INFO L895 garLoopResultBuilder]: At program point L507(line 507) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 1)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse8 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6))) [2023-12-19 01:40:45,169 INFO L899 garLoopResultBuilder]: For program point L507-1(line 507) no Hoare annotation was computed. [2023-12-19 01:40:45,170 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2023-12-19 01:40:45,170 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 214) no Hoare annotation was computed. [2023-12-19 01:40:45,170 INFO L895 garLoopResultBuilder]: At program point L1003(line 1003) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~m_st~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_st~0 0) .cse5 .cse6 .cse7 .cse8 (= ~token~0 ~local~0) .cse9))) [2023-12-19 01:40:45,170 INFO L895 garLoopResultBuilder]: At program point L640(line 640) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse5 (= ~token~0 ~local~0))) (or (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (not (= ~m_pc~0 1)) (<= ~t1_pc~0 0) .cse3 .cse4 .cse5))) [2023-12-19 01:40:45,170 INFO L899 garLoopResultBuilder]: For program point L640-1(line 640) no Hoare annotation was computed. [2023-12-19 01:40:45,170 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 203 261) no Hoare annotation was computed. [2023-12-19 01:40:45,170 INFO L895 garLoopResultBuilder]: At program point L443(lines 418 458) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 1)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse8 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6))) [2023-12-19 01:40:45,170 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 187) no Hoare annotation was computed. [2023-12-19 01:40:45,170 INFO L899 garLoopResultBuilder]: For program point L939(lines 939 943) no Hoare annotation was computed. [2023-12-19 01:40:45,170 INFO L899 garLoopResultBuilder]: For program point L939-2(lines 938 961) no Hoare annotation was computed. [2023-12-19 01:40:45,170 INFO L899 garLoopResultBuilder]: For program point eval1_returnLabel#1(lines 412 464) no Hoare annotation was computed. [2023-12-19 01:40:45,170 INFO L899 garLoopResultBuilder]: For program point L378-1(lines 369 386) no Hoare annotation was computed. [2023-12-19 01:40:45,170 INFO L899 garLoopResultBuilder]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2023-12-19 01:40:45,170 INFO L895 garLoopResultBuilder]: At program point L511(line 511) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 1)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse8 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6))) [2023-12-19 01:40:45,171 INFO L895 garLoopResultBuilder]: At program point L511-1(line 511) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 1)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse8 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6))) [2023-12-19 01:40:45,171 INFO L895 garLoopResultBuilder]: At program point L247(line 247) the Hoare annotation is: false [2023-12-19 01:40:45,171 INFO L895 garLoopResultBuilder]: At program point L1007-1(lines 1007 1044) the Hoare annotation is: (let ((.cse12 (= (+ ~local~0 1) ~token~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~t1_st~0)) (.cse13 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse13 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse4 .cse6 .cse7) (and .cse0 .cse1 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse2 .cse13 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse8 .cse2 .cse13 .cse3 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse2 .cse4 .cse6 .cse7 .cse9))) [2023-12-19 01:40:45,171 INFO L895 garLoopResultBuilder]: At program point L512(line 512) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 1)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse8 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6))) [2023-12-19 01:40:45,171 INFO L899 garLoopResultBuilder]: For program point L281(lines 281 285) no Hoare annotation was computed. [2023-12-19 01:40:45,171 INFO L899 garLoopResultBuilder]: For program point L281-2(lines 280 293) no Hoare annotation was computed. [2023-12-19 01:40:45,171 INFO L895 garLoopResultBuilder]: At program point L678-1(lines 678 691) the Hoare annotation is: (let ((.cse8 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse10 (not (= ~m_pc~0 1))) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse11 (= (+ ~local~0 1) ~token~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse5 (= ~p_dw_st~0 0)) (.cse6 (= ~c_dr_pc~0 0)) (.cse7 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse10 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2023-12-19 01:40:45,171 INFO L895 garLoopResultBuilder]: At program point L513(line 513) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 1)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse8 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6))) [2023-12-19 01:40:45,171 INFO L899 garLoopResultBuilder]: For program point L480(lines 469 482) no Hoare annotation was computed. [2023-12-19 01:40:45,172 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 454) no Hoare annotation was computed. [2023-12-19 01:40:45,172 INFO L899 garLoopResultBuilder]: For program point L944-1(lines 938 961) no Hoare annotation was computed. [2023-12-19 01:40:45,172 INFO L895 garLoopResultBuilder]: At program point L813-1(lines 789 827) the Hoare annotation is: (let ((.cse12 (= (+ ~local~0 1) ~token~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~t1_st~0)) (.cse13 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse13 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse4 .cse6 .cse7) (and .cse0 .cse1 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse2 .cse13 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse8 .cse2 .cse13 .cse3 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse2 .cse4 .cse6 .cse7 .cse9))) [2023-12-19 01:40:45,172 INFO L895 garLoopResultBuilder]: At program point L648-1(lines 634 655) the Hoare annotation is: (let ((.cse6 (not (= ~m_pc~0 1))) (.cse9 (= ~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 ~E_M~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~t1_pc~0 0) .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= (+ ~local~0 1) ~token~0) .cse4 .cse5 .cse7 .cse8))) [2023-12-19 01:40:45,172 INFO L899 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2023-12-19 01:40:45,172 INFO L895 garLoopResultBuilder]: At program point L252(line 252) the Hoare annotation is: false [2023-12-19 01:40:45,172 INFO L895 garLoopResultBuilder]: At program point L252-1(lines 218 255) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~E_M~0 2)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 0) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 1) .cse4 .cse5) (and .cse1 .cse2 .cse3 (<= 1 ~p_dw_pc~0) .cse4 .cse5))) [2023-12-19 01:40:45,172 INFO L895 garLoopResultBuilder]: At program point L979(line 979) the Hoare annotation is: (let ((.cse12 (= (+ ~local~0 1) ~token~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~t1_st~0)) (.cse13 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse13 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse4 .cse6 .cse7) (and .cse0 .cse1 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse2 .cse13 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse8 .cse2 .cse13 .cse3 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse2 .cse4 .cse6 .cse7 .cse9))) [2023-12-19 01:40:45,173 INFO L899 garLoopResultBuilder]: For program point L979-1(line 979) no Hoare annotation was computed. [2023-12-19 01:40:45,173 INFO L899 garLoopResultBuilder]: For program point L286-1(lines 277 294) no Hoare annotation was computed. [2023-12-19 01:40:45,173 INFO L899 garLoopResultBuilder]: For program point L749(lines 749 753) no Hoare annotation was computed. [2023-12-19 01:40:45,173 INFO L899 garLoopResultBuilder]: For program point L749-2(lines 748 761) no Hoare annotation was computed. [2023-12-19 01:40:45,173 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 527) no Hoare annotation was computed. [2023-12-19 01:40:45,173 INFO L899 garLoopResultBuilder]: For program point L518-2(lines 518 527) no Hoare annotation was computed. [2023-12-19 01:40:45,173 INFO L895 garLoopResultBuilder]: At program point L419(line 419) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 1)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse8 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6))) [2023-12-19 01:40:45,173 INFO L899 garLoopResultBuilder]: For program point L981(lines 981 986) no Hoare annotation was computed. [2023-12-19 01:40:45,173 INFO L899 garLoopResultBuilder]: For program point L816(lines 816 823) no Hoare annotation was computed. [2023-12-19 01:40:45,173 INFO L899 garLoopResultBuilder]: For program point L816-2(lines 816 823) no Hoare annotation was computed. [2023-12-19 01:40:45,173 INFO L895 garLoopResultBuilder]: At program point L1015(line 1015) the Hoare annotation is: (let ((.cse12 (= (+ ~local~0 1) ~token~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~t1_st~0)) (.cse13 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse13 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse4 .cse6 .cse7) (and .cse0 .cse1 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse2 .cse13 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse8 .cse2 .cse13 .cse3 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse2 .cse4 .cse6 .cse7 .cse9))) [2023-12-19 01:40:45,173 INFO L899 garLoopResultBuilder]: For program point L1015-1(line 1015) no Hoare annotation was computed. [2023-12-19 01:40:45,173 INFO L899 garLoopResultBuilder]: For program point L949-1(lines 938 961) no Hoare annotation was computed. [2023-12-19 01:40:45,173 INFO L899 garLoopResultBuilder]: For program point L421(line 421) no Hoare annotation was computed. [2023-12-19 01:40:45,173 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-19 01:40:45,174 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 169) no Hoare annotation was computed. [2023-12-19 01:40:45,174 INFO L895 garLoopResultBuilder]: At program point L522(line 522) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 1)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse8 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6))) [2023-12-19 01:40:45,174 INFO L899 garLoopResultBuilder]: For program point L522-1(line 522) no Hoare annotation was computed. [2023-12-19 01:40:45,174 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2023-12-19 01:40:45,174 INFO L899 garLoopResultBuilder]: For program point L423-1(lines 418 458) no Hoare annotation was computed. [2023-12-19 01:40:45,174 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 364) no Hoare annotation was computed. [2023-12-19 01:40:45,174 INFO L899 garLoopResultBuilder]: For program point L357-2(lines 353 368) no Hoare annotation was computed. [2023-12-19 01:40:45,174 INFO L899 garLoopResultBuilder]: For program point L754-1(lines 745 762) no Hoare annotation was computed. [2023-12-19 01:40:45,174 INFO L895 garLoopResultBuilder]: At program point L688(line 688) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse5 (= ~p_dw_st~0 0)) (.cse6 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~m_pc~0 1)) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (= (+ ~local~0 1) ~token~0) .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0))))) [2023-12-19 01:40:45,174 INFO L899 garLoopResultBuilder]: For program point $Ultimate##38(lines 179 187) no Hoare annotation was computed. [2023-12-19 01:40:45,174 INFO L899 garLoopResultBuilder]: For program point L688-1(line 688) no Hoare annotation was computed. [2023-12-19 01:40:45,174 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 168) no Hoare annotation was computed. [2023-12-19 01:40:45,174 INFO L895 garLoopResultBuilder]: At program point L1019(line 1019) the Hoare annotation is: (let ((.cse12 (= (+ ~local~0 1) ~token~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~t1_st~0)) (.cse13 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse13 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse4 .cse6 .cse7) (and .cse0 .cse1 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse2 .cse13 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse8 .cse2 .cse13 .cse3 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse2 .cse4 .cse6 .cse7 .cse9))) [2023-12-19 01:40:45,175 INFO L895 garLoopResultBuilder]: At program point L1019-1(line 1019) the Hoare annotation is: (let ((.cse12 (= (+ ~local~0 1) ~token~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~t1_st~0)) (.cse13 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse13 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse4 .cse6 .cse7) (and .cse0 .cse1 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse2 .cse13 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse8 .cse2 .cse13 .cse3 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse2 .cse4 .cse6 .cse7 .cse9))) [2023-12-19 01:40:45,175 INFO L899 garLoopResultBuilder]: For program point L623(lines 623 631) no Hoare annotation was computed. [2023-12-19 01:40:45,175 INFO L895 garLoopResultBuilder]: At program point L1020(line 1020) the Hoare annotation is: (let ((.cse12 (= (+ ~local~0 1) ~token~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~t1_st~0)) (.cse13 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse13 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse4 .cse6 .cse7) (and .cse0 .cse1 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse2 .cse13 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse8 .cse2 .cse13 .cse3 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse2 .cse4 .cse6 .cse7 .cse9))) [2023-12-19 01:40:45,175 INFO L899 garLoopResultBuilder]: For program point L954-1(lines 935 962) no Hoare annotation was computed. [2023-12-19 01:40:45,175 INFO L895 garLoopResultBuilder]: At program point L492(line 492) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (not (= ~m_pc~0 1)) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~E_M~0 2) (= ~M_E~0 2)) [2023-12-19 01:40:45,175 INFO L899 garLoopResultBuilder]: For program point L492-1(line 492) no Hoare annotation was computed. [2023-12-19 01:40:45,175 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-19 01:40:45,176 INFO L895 garLoopResultBuilder]: At program point L1021(line 1021) the Hoare annotation is: (let ((.cse12 (= (+ ~local~0 1) ~token~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~t1_st~0)) (.cse13 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse13 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse4 .cse6 .cse7) (and .cse0 .cse1 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse2 .cse13 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse8 .cse2 .cse13 .cse3 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse2 .cse4 .cse6 .cse7 .cse9))) [2023-12-19 01:40:45,176 INFO L899 garLoopResultBuilder]: For program point L988(lines 977 990) no Hoare annotation was computed. [2023-12-19 01:40:45,176 INFO L895 garLoopResultBuilder]: At program point L790(line 790) the Hoare annotation is: (let ((.cse12 (= (+ ~local~0 1) ~token~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~t1_st~0)) (.cse13 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (<= 2 ~m_st~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse13 .cse6 .cse7) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse8 .cse2 .cse4 .cse6 .cse7) (and .cse0 .cse1 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse2 .cse13 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse8 .cse2 .cse13 .cse3 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse2 .cse4 .cse6 .cse7 .cse9))) [2023-12-19 01:40:45,176 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2023-12-19 01:40:45,176 INFO L899 garLoopResultBuilder]: For program point L626(lines 626 630) no Hoare annotation was computed. [2023-12-19 01:40:45,176 INFO L895 garLoopResultBuilder]: At program point L494(line 494) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 0) (= ~E_M~0 2) (= ~M_E~0 2)) [2023-12-19 01:40:45,176 INFO L895 garLoopResultBuilder]: At program point L494-1(line 494) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 0) (= ~E_M~0 2) (= ~M_E~0 2)) [2023-12-19 01:40:45,176 INFO L899 garLoopResultBuilder]: For program point L428(lines 418 458) no Hoare annotation was computed. [2023-12-19 01:40:45,176 INFO L899 garLoopResultBuilder]: For program point L792(line 792) no Hoare annotation was computed. [2023-12-19 01:40:45,176 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2023-12-19 01:40:45,176 INFO L895 garLoopResultBuilder]: At program point L495(line 495) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 0) (= ~E_M~0 2) (= ~M_E~0 2)) [2023-12-19 01:40:45,176 INFO L899 garLoopResultBuilder]: For program point L1024(line 1024) no Hoare annotation was computed. [2023-12-19 01:40:45,177 INFO L899 garLoopResultBuilder]: For program point $Ultimate##115(lines 648 654) no Hoare annotation was computed. [2023-12-19 01:40:45,177 INFO L899 garLoopResultBuilder]: For program point L794(lines 794 798) no Hoare annotation was computed. [2023-12-19 01:40:45,177 INFO L899 garLoopResultBuilder]: For program point L794-1(lines 789 827) no Hoare annotation was computed. [2023-12-19 01:40:45,177 INFO L899 garLoopResultBuilder]: For program point L1026(lines 1026 1035) no Hoare annotation was computed. [2023-12-19 01:40:45,177 INFO L899 garLoopResultBuilder]: For program point L95(lines 73 97) no Hoare annotation was computed. [2023-12-19 01:40:45,177 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2023-12-19 01:40:45,177 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 84 93) no Hoare annotation was computed. [2023-12-19 01:40:45,177 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 70 98) no Hoare annotation was computed. [2023-12-19 01:40:45,177 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 80) no Hoare annotation was computed. [2023-12-19 01:40:45,177 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2023-12-19 01:40:45,177 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 70 98) the Hoare annotation is: true [2023-12-19 01:40:45,177 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 73 97) no Hoare annotation was computed. [2023-12-19 01:40:45,177 INFO L899 garLoopResultBuilder]: For program point L311(lines 298 313) no Hoare annotation was computed. [2023-12-19 01:40:45,177 INFO L899 garLoopResultBuilder]: For program point L303(lines 303 308) no Hoare annotation was computed. [2023-12-19 01:40:45,177 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 309) no Hoare annotation was computed. [2023-12-19 01:40:45,177 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 295 314) the Hoare annotation is: true [2023-12-19 01:40:45,177 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 295 314) no Hoare annotation was computed. [2023-12-19 01:40:45,177 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 23 30) the Hoare annotation is: true [2023-12-19 01:40:45,177 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2023-12-19 01:40:45,177 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2023-12-19 01:40:45,177 INFO L899 garLoopResultBuilder]: For program point L767(lines 767 777) no Hoare annotation was computed. [2023-12-19 01:40:45,177 INFO L899 garLoopResultBuilder]: For program point L779(lines 766 781) no Hoare annotation was computed. [2023-12-19 01:40:45,178 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 763 782) the Hoare annotation is: true [2023-12-19 01:40:45,178 INFO L899 garLoopResultBuilder]: For program point L771(lines 771 776) no Hoare annotation was computed. [2023-12-19 01:40:45,178 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 763 782) no Hoare annotation was computed. [2023-12-19 01:40:45,178 INFO L899 garLoopResultBuilder]: For program point L337-1(lines 336 349) no Hoare annotation was computed. [2023-12-19 01:40:45,178 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 333 350) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_pc~0 1))) (.cse3 (not (= ~p_dw_pc~0 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~E_M~0 ~M_E~0))) (.cse4 (= ~m_pc~0 1)) (.cse5 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (< ~p_dw_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse6) (or .cse0 .cse1 (not (= ~c_dr_pc~0 0)) .cse2 .cse4 .cse5 .cse6 .cse8))) [2023-12-19 01:40:45,178 INFO L899 garLoopResultBuilder]: For program point L342-1(lines 333 350) no Hoare annotation was computed. [2023-12-19 01:40:45,178 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 333 350) no Hoare annotation was computed. [2023-12-19 01:40:45,178 INFO L899 garLoopResultBuilder]: For program point L866-1(lines 865 888) no Hoare annotation was computed. [2023-12-19 01:40:45,178 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 862 889) no Hoare annotation was computed. [2023-12-19 01:40:45,178 INFO L899 garLoopResultBuilder]: For program point L881-1(lines 862 889) no Hoare annotation was computed. [2023-12-19 01:40:45,178 INFO L899 garLoopResultBuilder]: For program point L876-1(lines 865 888) no Hoare annotation was computed. [2023-12-19 01:40:45,178 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 862 889) the Hoare annotation is: (let ((.cse9 (not (= ~token~0 ~local~0))) (.cse10 (< 0 ~t1_pc~0)) (.cse13 (= ~m_pc~0 1)) (.cse11 (not (= ~m_st~0 0))) (.cse12 (< ~t1_st~0 2)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (< ~m_st~0 2)) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse5 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse6 (< |old(~E_1~0)| 2)) (.cse7 (< |old(~E_M~0)| 2)) (.cse8 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (not (= (+ ~local~0 1) ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse9) (or .cse0 .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse12 .cse0 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6 .cse7 .cse8 .cse11 .cse9) (or .cse0 .cse10 .cse1 .cse3 .cse4 .cse13 .cse5 .cse6 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2))) (or .cse12 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse14) (or .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14))) [2023-12-19 01:40:45,178 INFO L899 garLoopResultBuilder]: For program point L871-1(lines 865 888) no Hoare annotation was computed. [2023-12-19 01:40:45,181 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:40:45,182 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 01:40:45,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 01:40:45 BoogieIcfgContainer [2023-12-19 01:40:45,198 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 01:40:45,198 INFO L158 Benchmark]: Toolchain (without parser) took 74387.16ms. Allocated memory was 202.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 154.7MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 919.5MB. Max. memory is 8.0GB. [2023-12-19 01:40:45,199 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 202.4MB. Free memory was 159.4MB in the beginning and 159.3MB in the end (delta: 71.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 01:40:45,199 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.82ms. Allocated memory is still 202.4MB. Free memory was 154.2MB in the beginning and 136.3MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-19 01:40:45,199 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.67ms. Allocated memory is still 202.4MB. Free memory was 136.3MB in the beginning and 133.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 01:40:45,199 INFO L158 Benchmark]: Boogie Preprocessor took 64.22ms. Allocated memory is still 202.4MB. Free memory was 133.7MB in the beginning and 130.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 01:40:45,199 INFO L158 Benchmark]: RCFGBuilder took 658.58ms. Allocated memory is still 202.4MB. Free memory was 130.1MB in the beginning and 96.5MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2023-12-19 01:40:45,199 INFO L158 Benchmark]: TraceAbstraction took 73277.30ms. Allocated memory was 202.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 96.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 860.8MB. Max. memory is 8.0GB. [2023-12-19 01:40:45,200 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.14ms. Allocated memory is still 202.4MB. Free memory was 159.4MB in the beginning and 159.3MB in the end (delta: 71.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 322.82ms. Allocated memory is still 202.4MB. Free memory was 154.2MB in the beginning and 136.3MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.67ms. Allocated memory is still 202.4MB. Free memory was 136.3MB in the beginning and 133.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.22ms. Allocated memory is still 202.4MB. Free memory was 133.7MB in the beginning and 130.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 658.58ms. Allocated memory is still 202.4MB. Free memory was 130.1MB in the beginning and 96.5MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 73277.30ms. Allocated memory was 202.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 96.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 860.8MB. 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: 599]: 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: 27]: 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, 199 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 73.2s, OverallIterations: 26, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 47.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9938 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9665 mSDsluCounter, 13891 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9636 mSDsCounter, 2079 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13493 IncrementalHoareTripleChecker+Invalid, 15572 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2079 mSolverCounterUnsat, 4255 mSDtfsCounter, 13493 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2026 GetRequests, 1732 SyntacticMatches, 0 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6117occurred in iteration=25, InterpolantAutomatonStates: 263, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 4297 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 7154 PreInvPairs, 8271 NumberOfFragments, 6425 HoareAnnotationTreeSize, 7154 FormulaSimplifications, 834116 FormulaSimplificationTreeSizeReduction, 36.3s HoareSimplificationTime, 52 FormulaSimplificationsInter, 89650 FormulaSimplificationTreeSizeReductionInter, 10.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 3504 NumberOfCodeBlocks, 3432 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3468 ConstructedInterpolants, 0 QuantifiedInterpolants, 6314 SizeOfPredicates, 2 NumberOfNonLiveVariables, 4007 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 36 InterpolantComputations, 26 PerfectInterpolantSequences, 1485/1626 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: 499]: Loop Invariant Derived loop invariant: ((((((((((m_pc == t1_pc) && (T1_E == 2)) && !((m_pc == 1))) && (1 <= p_dw_pc)) && (c_dr_pc == 1)) && (E_M == 2)) && (M_E == 2)) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (c_dr_pc == 0)) && (E_M == 2)) && (M_E == 2))) || (((((((m_pc == t1_pc) && (T1_E == 2)) && !((m_pc == 1))) && (1 <= p_dw_pc)) && (c_dr_pc == 0)) && (E_M == 2)) && (M_E == 2))) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (c_dr_pc == 1)) && (E_M == 2)) && (M_E == 2))) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((c_dr_pc == 0) && (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (E_M == 2)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && !((m_pc == 1))) && (1 <= p_dw_pc)) && (E_M == 2)) && (M_E == 2)))) || ((c_dr_pc == 1) && (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (E_M == 2)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && !((m_pc == 1))) && (1 <= p_dw_pc)) && (E_M == 2)) && (M_E == 2))))) - InvariantResult [Line: 634]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (t1_pc <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && ((local + 1) == token)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (p_dw_st == 0)) && (c_dr_pc == 0))) - InvariantResult [Line: 1007]: Loop Invariant Derived loop invariant: (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (2 <= m_st)) && (t1_pc <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (t1_pc <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || ((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (2 <= m_st)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && ((local + 1) == token)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && ((local + 1) == token)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && !((m_pc == 1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) - InvariantResult [Line: 789]: Loop Invariant Derived loop invariant: (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (2 <= m_st)) && (t1_pc <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (t1_pc <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || ((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (2 <= m_st)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && ((local + 1) == token)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && ((local + 1) == token)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && !((m_pc == 1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((((((((((m_pc == t1_pc) && (T1_E == 2)) && !((m_pc == 1))) && (1 <= p_dw_pc)) && (c_dr_pc == 1)) && (E_M == 2)) && (M_E == 2)) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (c_dr_pc == 0)) && (E_M == 2)) && (M_E == 2))) || (((((((m_pc == t1_pc) && (T1_E == 2)) && !((m_pc == 1))) && (1 <= p_dw_pc)) && (c_dr_pc == 0)) && (E_M == 2)) && (M_E == 2))) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (c_dr_pc == 1)) && (E_M == 2)) && (M_E == 2))) - InvariantResult [Line: 678]: Loop Invariant Derived loop invariant: (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && !((t1_st == 0))) && (token == local)) || ((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && !((m_pc == 1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && !((t1_st == 0))) && (token == local))) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && ((local + 1) == token)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && !((t1_st == 0)))) || (((((((p_dw_pc == 0) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (2 <= m_st)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && ((local + 1) == token)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && !((t1_st == 0)))) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: (((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (c_dr_pc == 0)) && (E_M == 2)) && (M_E == 2)) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (c_dr_pc == 1)) && (E_M == 2)) && (M_E == 2))) || ((((((m_pc == t1_pc) && (T1_E == 2)) && !((m_pc == 1))) && (1 <= p_dw_pc)) && (E_M == 2)) && (M_E == 2))) RESULT: Ultimate proved your program to be correct! [2023-12-19 01:40:45,228 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...