/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.02.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 01:39:34,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 01:39:34,924 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:34,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 01:39:34,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 01:39:34,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 01:39:34,949 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 01:39:34,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 01:39:34,950 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 01:39:34,950 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 01:39:34,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 01:39:34,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 01:39:34,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 01:39:34,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 01:39:34,952 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 01:39:34,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 01:39:34,952 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 01:39:34,953 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 01:39:34,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 01:39:34,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 01:39:34,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 01:39:34,954 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 01:39:34,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 01:39:34,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 01:39:34,955 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 01:39:34,955 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 01:39:34,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 01:39:34,956 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 01:39:34,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 01:39:34,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 01:39:34,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 01:39:34,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 01:39:34,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 01:39:34,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 01:39:34,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 01:39:34,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 01:39:34,957 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 01:39:34,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 01:39:34,958 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 01:39:34,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 01:39:34,958 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 01:39:34,959 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 01:39:34,959 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 01:39:34,959 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:35,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 01:39:35,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 01:39:35,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 01:39:35,146 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 01:39:35,146 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 01:39:35,147 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.02.cil-1.c [2023-12-19 01:39:36,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 01:39:36,453 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 01:39:36,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2023-12-19 01:39:36,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb518eaff/0193bcb897aa4a18ad17b41154fda5c0/FLAGc53879c46 [2023-12-19 01:39:36,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb518eaff/0193bcb897aa4a18ad17b41154fda5c0 [2023-12-19 01:39:36,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 01:39:36,482 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 01:39:36,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 01:39:36,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 01:39:36,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 01:39:36,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:39:36" (1/1) ... [2023-12-19 01:39:36,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43bce4ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:39:36, skipping insertion in model container [2023-12-19 01:39:36,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:39:36" (1/1) ... [2023-12-19 01:39:36,520 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 01:39:36,628 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.02.cil-1.c[911,924] [2023-12-19 01:39:36,670 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.02.cil-1.c[8416,8429] [2023-12-19 01:39:36,697 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 01:39:36,707 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 01:39:36,715 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.02.cil-1.c[911,924] [2023-12-19 01:39:36,731 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.02.cil-1.c[8416,8429] [2023-12-19 01:39:36,758 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 01:39:36,776 INFO L206 MainTranslator]: Completed translation [2023-12-19 01:39:36,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:39:36 WrapperNode [2023-12-19 01:39:36,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 01:39:36,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 01:39:36,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 01:39:36,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 01:39:36,782 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:36" (1/1) ... [2023-12-19 01:39:36,794 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:36" (1/1) ... [2023-12-19 01:39:36,839 INFO L138 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 506 [2023-12-19 01:39:36,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 01:39:36,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 01:39:36,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 01:39:36,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 01:39:36,849 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:36" (1/1) ... [2023-12-19 01:39:36,850 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:36" (1/1) ... [2023-12-19 01:39:36,861 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:36" (1/1) ... [2023-12-19 01:39:36,887 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:36,888 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:36" (1/1) ... [2023-12-19 01:39:36,888 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:36" (1/1) ... [2023-12-19 01:39:36,909 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:36" (1/1) ... [2023-12-19 01:39:36,915 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:36" (1/1) ... [2023-12-19 01:39:36,916 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:36" (1/1) ... [2023-12-19 01:39:36,918 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:36" (1/1) ... [2023-12-19 01:39:36,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 01:39:36,928 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 01:39:36,928 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 01:39:36,928 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 01:39:36,929 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:39:36" (1/1) ... [2023-12-19 01:39:36,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 01:39:36,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:39:36,957 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:36,975 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:36,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 01:39:36,993 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-19 01:39:36,993 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-19 01:39:36,994 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-12-19 01:39:36,995 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-12-19 01:39:36,995 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-19 01:39:36,995 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-19 01:39:36,995 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-19 01:39:36,996 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-19 01:39:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-12-19 01:39:36,996 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-12-19 01:39:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-19 01:39:36,996 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-19 01:39:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-19 01:39:36,996 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-19 01:39:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-12-19 01:39:36,996 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-12-19 01:39:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-12-19 01:39:36,997 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-12-19 01:39:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-12-19 01:39:36,997 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-12-19 01:39:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-19 01:39:36,997 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-19 01:39:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 01:39:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-19 01:39:36,999 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-19 01:39:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-12-19 01:39:36,999 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-12-19 01:39:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 01:39:37,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 01:39:37,000 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-19 01:39:37,000 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-19 01:39:37,121 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 01:39:37,124 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 01:39:37,553 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2023-12-19 01:39:37,553 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:37,588 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 01:39:37,636 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 01:39:37,636 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-12-19 01:39:37,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:39:37 BoogieIcfgContainer [2023-12-19 01:39:37,637 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 01:39:37,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 01:39:37,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 01:39:37,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 01:39:37,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 01:39:36" (1/3) ... [2023-12-19 01:39:37,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508227c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:39:37, skipping insertion in model container [2023-12-19 01:39:37,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:39:36" (2/3) ... [2023-12-19 01:39:37,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508227c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:39:37, skipping insertion in model container [2023-12-19 01:39:37,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:39:37" (3/3) ... [2023-12-19 01:39:37,642 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-1.c [2023-12-19 01:39:37,654 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 01:39:37,654 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-19 01:39:37,695 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 01:39:37,699 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@261ad412, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 01:39:37,700 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-19 01:39:37,707 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 173 states have (on average 1.6416184971098267) internal successors, (284), 179 states have internal predecessors, (284), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-19 01:39:37,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-19 01:39:37,717 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:37,718 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:37,718 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:37,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:37,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1924252270, now seen corresponding path program 1 times [2023-12-19 01:39:37,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:37,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373077176] [2023-12-19 01:39:37,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:37,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:38,100 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 15 [2023-12-19 01:39:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:39:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:39:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:39:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:39:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:38,175 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,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:38,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373077176] [2023-12-19 01:39:38,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373077176] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:38,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:38,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 01:39:38,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253125067] [2023-12-19 01:39:38,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:38,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 01:39:38,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:38,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 01:39:38,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:39:38,212 INFO L87 Difference]: Start difference. First operand has 222 states, 173 states have (on average 1.6416184971098267) internal successors, (284), 179 states have internal predecessors, (284), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) 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:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:39,013 INFO L93 Difference]: Finished difference Result 567 states and 893 transitions. [2023-12-19 01:39:39,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 01:39:39,015 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:39,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:39,024 INFO L225 Difference]: With dead ends: 567 [2023-12-19 01:39:39,024 INFO L226 Difference]: Without dead ends: 355 [2023-12-19 01:39:39,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-12-19 01:39:39,030 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 482 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:39,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 833 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:39:39,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2023-12-19 01:39:39,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 318. [2023-12-19 01:39:39,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 249 states have (on average 1.5060240963855422) internal successors, (375), 255 states have internal predecessors, (375), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2023-12-19 01:39:39,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 468 transitions. [2023-12-19 01:39:39,090 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 468 transitions. Word has length 57 [2023-12-19 01:39:39,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:39,091 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 468 transitions. [2023-12-19 01:39:39,091 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:39,091 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 468 transitions. [2023-12-19 01:39:39,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-19 01:39:39,094 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:39,094 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:39,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 01:39:39,094 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:39,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:39,095 INFO L85 PathProgramCache]: Analyzing trace with hash 426722258, now seen corresponding path program 1 times [2023-12-19 01:39:39,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:39,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869522380] [2023-12-19 01:39:39,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:39,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:39,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:39,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:39,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:39:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:39,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:39:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:39,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:39:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:39,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:39:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:39,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:39:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:39,230 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,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:39,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869522380] [2023-12-19 01:39:39,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869522380] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:39,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:39,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:39:39,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28389736] [2023-12-19 01:39:39,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:39,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:39:39,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:39,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:39:39,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:39,239 INFO L87 Difference]: Start difference. First operand 318 states and 468 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:39,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:39,777 INFO L93 Difference]: Finished difference Result 740 states and 1074 transitions. [2023-12-19 01:39:39,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 01:39:39,782 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:39,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:39,791 INFO L225 Difference]: With dead ends: 740 [2023-12-19 01:39:39,791 INFO L226 Difference]: Without dead ends: 552 [2023-12-19 01:39:39,795 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:39,796 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 883 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:39,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 693 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:39:39,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2023-12-19 01:39:39,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 484. [2023-12-19 01:39:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 379 states have (on average 1.4775725593667546) internal successors, (560), 387 states have internal predecessors, (560), 65 states have call successors, (65), 35 states have call predecessors, (65), 38 states have return successors, (71), 64 states have call predecessors, (71), 63 states have call successors, (71) [2023-12-19 01:39:39,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 696 transitions. [2023-12-19 01:39:39,862 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 696 transitions. Word has length 57 [2023-12-19 01:39:39,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:39,863 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 696 transitions. [2023-12-19 01:39:39,863 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:39,863 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 696 transitions. [2023-12-19 01:39:39,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-19 01:39:39,865 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:39,865 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,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 01:39:39,866 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:39,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:39,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1208441665, now seen corresponding path program 1 times [2023-12-19 01:39:39,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:39,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612940752] [2023-12-19 01:39:39,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:39,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:39,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:39,928 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 10 [2023-12-19 01:39:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:39,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:39:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:39,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:39:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:40,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:40,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 01:39:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:40,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-19 01:39:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:40,032 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:40,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:40,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612940752] [2023-12-19 01:39:40,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612940752] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:40,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:40,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 01:39:40,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269522404] [2023-12-19 01:39:40,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:40,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 01:39:40,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:40,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 01:39:40,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:39:40,039 INFO L87 Difference]: Start difference. First operand 484 states and 696 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:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:40,626 INFO L93 Difference]: Finished difference Result 906 states and 1297 transitions. [2023-12-19 01:39:40,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 01:39:40,626 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:40,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:40,629 INFO L225 Difference]: With dead ends: 906 [2023-12-19 01:39:40,629 INFO L226 Difference]: Without dead ends: 552 [2023-12-19 01:39:40,630 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:40,631 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 254 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:40,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1159 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:39:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2023-12-19 01:39:40,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 492. [2023-12-19 01:39:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 385 states have (on average 1.464935064935065) internal successors, (564), 393 states have internal predecessors, (564), 65 states have call successors, (65), 35 states have call predecessors, (65), 40 states have return successors, (73), 66 states have call predecessors, (73), 63 states have call successors, (73) [2023-12-19 01:39:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 702 transitions. [2023-12-19 01:39:40,658 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 702 transitions. Word has length 58 [2023-12-19 01:39:40,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:40,658 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 702 transitions. [2023-12-19 01:39:40,659 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:40,659 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 702 transitions. [2023-12-19 01:39:40,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-19 01:39:40,660 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:40,660 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:40,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 01:39:40,660 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:40,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:40,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1280828223, now seen corresponding path program 1 times [2023-12-19 01:39:40,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:40,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273191842] [2023-12-19 01:39:40,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:40,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:40,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:40,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:40,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:39:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:40,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:39:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:40,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:40,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 01:39:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:40,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-19 01:39:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:40,798 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:40,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:40,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273191842] [2023-12-19 01:39:40,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273191842] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:40,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:40,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 01:39:40,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818324954] [2023-12-19 01:39:40,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:40,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 01:39:40,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:40,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 01:39:40,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:39:40,800 INFO L87 Difference]: Start difference. First operand 492 states and 702 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:42,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:42,249 INFO L93 Difference]: Finished difference Result 1887 states and 2721 transitions. [2023-12-19 01:39:42,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-19 01:39:42,249 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:42,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:42,256 INFO L225 Difference]: With dead ends: 1887 [2023-12-19 01:39:42,256 INFO L226 Difference]: Without dead ends: 746 [2023-12-19 01:39:42,259 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:42,263 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 1271 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 1878 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 2193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 1878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:42,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 1440 Invalid, 2193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 1878 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-19 01:39:42,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2023-12-19 01:39:42,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 628. [2023-12-19 01:39:42,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 484 states have (on average 1.4173553719008265) internal successors, (686), 494 states have internal predecessors, (686), 85 states have call successors, (85), 49 states have call predecessors, (85), 57 states have return successors, (104), 87 states have call predecessors, (104), 83 states have call successors, (104) [2023-12-19 01:39:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 875 transitions. [2023-12-19 01:39:42,313 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 875 transitions. Word has length 58 [2023-12-19 01:39:42,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:42,314 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 875 transitions. [2023-12-19 01:39:42,314 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:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 875 transitions. [2023-12-19 01:39:42,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-19 01:39:42,315 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:42,316 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,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 01:39:42,316 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:42,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:42,316 INFO L85 PathProgramCache]: Analyzing trace with hash 360418206, now seen corresponding path program 1 times [2023-12-19 01:39:42,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:42,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657278565] [2023-12-19 01:39:42,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:42,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:42,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:42,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:42,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:39:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:42,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:39:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:42,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:42,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:39:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:42,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 01:39:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:42,441 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,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:42,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657278565] [2023-12-19 01:39:42,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657278565] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:42,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:42,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 01:39:42,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463101087] [2023-12-19 01:39:42,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:42,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 01:39:42,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:42,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 01:39:42,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:39:42,443 INFO L87 Difference]: Start difference. First operand 628 states and 875 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-19 01:39:43,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:43,131 INFO L93 Difference]: Finished difference Result 1474 states and 2056 transitions. [2023-12-19 01:39:43,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 01:39:43,131 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), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2023-12-19 01:39:43,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:43,132 INFO L225 Difference]: With dead ends: 1474 [2023-12-19 01:39:43,132 INFO L226 Difference]: Without dead ends: 117 [2023-12-19 01:39:43,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-12-19 01:39:43,134 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 851 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:43,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 833 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:39:43,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-19 01:39:43,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-12-19 01:39:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.5212765957446808) internal successors, (143), 95 states have internal predecessors, (143), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 01:39:43,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 175 transitions. [2023-12-19 01:39:43,139 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 175 transitions. Word has length 59 [2023-12-19 01:39:43,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:43,139 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 175 transitions. [2023-12-19 01:39:43,139 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), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-19 01:39:43,140 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 175 transitions. [2023-12-19 01:39:43,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-19 01:39:43,140 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:43,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:43,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 01:39:43,140 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:43,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:43,141 INFO L85 PathProgramCache]: Analyzing trace with hash 751681765, now seen corresponding path program 1 times [2023-12-19 01:39:43,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:43,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827573117] [2023-12-19 01:39:43,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:43,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:43,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:43,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:43,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:39:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:43,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:39:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:43,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:39:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:43,209 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,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:43,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827573117] [2023-12-19 01:39:43,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827573117] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:43,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:43,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:39:43,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378358935] [2023-12-19 01:39:43,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:43,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:39:43,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:43,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:39:43,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:39:43,210 INFO L87 Difference]: Start difference. First operand 117 states and 175 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:39:43,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:43,691 INFO L93 Difference]: Finished difference Result 392 states and 601 transitions. [2023-12-19 01:39:43,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 01:39:43,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-19 01:39:43,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:43,693 INFO L225 Difference]: With dead ends: 392 [2023-12-19 01:39:43,693 INFO L226 Difference]: Without dead ends: 284 [2023-12-19 01:39:43,694 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:43,694 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 388 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:43,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 354 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:39:43,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-12-19 01:39:43,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 225. [2023-12-19 01:39:43,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 184 states have (on average 1.5271739130434783) internal successors, (281), 186 states have internal predecessors, (281), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2023-12-19 01:39:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 338 transitions. [2023-12-19 01:39:43,709 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 338 transitions. Word has length 61 [2023-12-19 01:39:43,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:43,709 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 338 transitions. [2023-12-19 01:39:43,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:39:43,710 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 338 transitions. [2023-12-19 01:39:43,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-19 01:39:43,710 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:43,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:43,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 01:39:43,711 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:43,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:43,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1534836827, now seen corresponding path program 1 times [2023-12-19 01:39:43,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:43,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368440610] [2023-12-19 01:39:43,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:43,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:43,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:43,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:43,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:39:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:43,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:39:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:43,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:39:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:43,812 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,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:43,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368440610] [2023-12-19 01:39:43,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368440610] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:43,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:43,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:39:43,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541442253] [2023-12-19 01:39:43,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:43,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:39:43,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:43,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:39:43,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:43,813 INFO L87 Difference]: Start difference. First operand 225 states and 338 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:39:44,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:44,491 INFO L93 Difference]: Finished difference Result 637 states and 967 transitions. [2023-12-19 01:39:44,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 01:39:44,504 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-19 01:39:44,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:44,507 INFO L225 Difference]: With dead ends: 637 [2023-12-19 01:39:44,507 INFO L226 Difference]: Without dead ends: 421 [2023-12-19 01:39:44,507 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:44,508 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 395 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:44,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 650 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:39:44,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2023-12-19 01:39:44,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 326. [2023-12-19 01:39:44,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 267 states have (on average 1.5168539325842696) internal successors, (405), 270 states have internal predecessors, (405), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2023-12-19 01:39:44,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 486 transitions. [2023-12-19 01:39:44,523 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 486 transitions. Word has length 61 [2023-12-19 01:39:44,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:44,523 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 486 transitions. [2023-12-19 01:39:44,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:39:44,524 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 486 transitions. [2023-12-19 01:39:44,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-19 01:39:44,524 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:44,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:44,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 01:39:44,525 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:44,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:44,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1550355545, now seen corresponding path program 1 times [2023-12-19 01:39:44,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:44,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965049208] [2023-12-19 01:39:44,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:44,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:44,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:44,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:44,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:39:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:44,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:39:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:44,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:39:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:44,598 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,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:44,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965049208] [2023-12-19 01:39:44,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965049208] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:44,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:44,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:39:44,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424163372] [2023-12-19 01:39:44,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:44,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:39:44,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:44,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:39:44,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:44,600 INFO L87 Difference]: Start difference. First operand 326 states and 486 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:39:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:45,409 INFO L93 Difference]: Finished difference Result 1058 states and 1599 transitions. [2023-12-19 01:39:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 01:39:45,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-19 01:39:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:45,413 INFO L225 Difference]: With dead ends: 1058 [2023-12-19 01:39:45,413 INFO L226 Difference]: Without dead ends: 741 [2023-12-19 01:39:45,414 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:45,414 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 407 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:45,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 641 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:39:45,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2023-12-19 01:39:45,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 528. [2023-12-19 01:39:45,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 435 states have (on average 1.5126436781609196) internal successors, (658), 440 states have internal predecessors, (658), 58 states have call successors, (58), 30 states have call predecessors, (58), 34 states have return successors, (71), 61 states have call predecessors, (71), 58 states have call successors, (71) [2023-12-19 01:39:45,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 787 transitions. [2023-12-19 01:39:45,448 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 787 transitions. Word has length 61 [2023-12-19 01:39:45,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:45,448 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 787 transitions. [2023-12-19 01:39:45,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:39:45,448 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 787 transitions. [2023-12-19 01:39:45,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-19 01:39:45,449 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:45,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:45,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 01:39:45,449 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:45,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:45,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1903443927, now seen corresponding path program 1 times [2023-12-19 01:39:45,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:45,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815825303] [2023-12-19 01:39:45,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:45,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:39:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:39:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:39:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:45,532 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:45,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:45,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815825303] [2023-12-19 01:39:45,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815825303] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:45,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:45,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:39:45,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682719244] [2023-12-19 01:39:45,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:45,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:39:45,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:45,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:39:45,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:45,534 INFO L87 Difference]: Start difference. First operand 528 states and 787 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:39:46,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:46,287 INFO L93 Difference]: Finished difference Result 1762 states and 2650 transitions. [2023-12-19 01:39:46,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 01:39:46,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-19 01:39:46,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:46,293 INFO L225 Difference]: With dead ends: 1762 [2023-12-19 01:39:46,293 INFO L226 Difference]: Without dead ends: 1243 [2023-12-19 01:39:46,295 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:46,297 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 434 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:46,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 637 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:39:46,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2023-12-19 01:39:46,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 909. [2023-12-19 01:39:46,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 750 states have (on average 1.5066666666666666) internal successors, (1130), 759 states have internal predecessors, (1130), 96 states have call successors, (96), 54 states have call predecessors, (96), 62 states have return successors, (131), 103 states have call predecessors, (131), 96 states have call successors, (131) [2023-12-19 01:39:46,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1357 transitions. [2023-12-19 01:39:46,364 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1357 transitions. Word has length 61 [2023-12-19 01:39:46,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:46,365 INFO L495 AbstractCegarLoop]: Abstraction has 909 states and 1357 transitions. [2023-12-19 01:39:46,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:39:46,366 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1357 transitions. [2023-12-19 01:39:46,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-19 01:39:46,369 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:46,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:46,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 01:39:46,370 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:46,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:46,370 INFO L85 PathProgramCache]: Analyzing trace with hash 24828775, now seen corresponding path program 1 times [2023-12-19 01:39:46,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:46,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550097719] [2023-12-19 01:39:46,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:46,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:46,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:46,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:46,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:39:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:46,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:39:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:46,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:39:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:46,458 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:46,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:46,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550097719] [2023-12-19 01:39:46,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550097719] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:46,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:46,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:39:46,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628458875] [2023-12-19 01:39:46,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:46,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:39:46,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:46,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:39:46,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:46,460 INFO L87 Difference]: Start difference. First operand 909 states and 1357 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:39:47,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:47,249 INFO L93 Difference]: Finished difference Result 3035 states and 4556 transitions. [2023-12-19 01:39:47,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 01:39:47,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-19 01:39:47,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:47,259 INFO L225 Difference]: With dead ends: 3035 [2023-12-19 01:39:47,259 INFO L226 Difference]: Without dead ends: 2135 [2023-12-19 01:39:47,263 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:47,264 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 384 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:47,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 619 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:39:47,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2023-12-19 01:39:47,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 1684. [2023-12-19 01:39:47,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1401 states have (on average 1.5060670949321913) internal successors, (2110), 1418 states have internal predecessors, (2110), 166 states have call successors, (166), 100 states have call predecessors, (166), 116 states have return successors, (263), 181 states have call predecessors, (263), 166 states have call successors, (263) [2023-12-19 01:39:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2539 transitions. [2023-12-19 01:39:47,372 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2539 transitions. Word has length 61 [2023-12-19 01:39:47,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:47,372 INFO L495 AbstractCegarLoop]: Abstraction has 1684 states and 2539 transitions. [2023-12-19 01:39:47,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:39:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2539 transitions. [2023-12-19 01:39:47,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-19 01:39:47,375 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:47,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:47,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 01:39:47,375 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:47,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:47,376 INFO L85 PathProgramCache]: Analyzing trace with hash 918315113, now seen corresponding path program 1 times [2023-12-19 01:39:47,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:47,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945169874] [2023-12-19 01:39:47,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:47,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:47,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:47,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:47,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:39:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:47,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:39:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:47,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:39:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:47,473 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:47,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:47,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945169874] [2023-12-19 01:39:47,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945169874] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:47,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:39:47,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:39:47,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593180603] [2023-12-19 01:39:47,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:47,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:39:47,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:47,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:39:47,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:47,475 INFO L87 Difference]: Start difference. First operand 1684 states and 2539 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:39:48,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:48,501 INFO L93 Difference]: Finished difference Result 7707 states and 11871 transitions. [2023-12-19 01:39:48,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-19 01:39:48,502 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-19 01:39:48,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:48,561 INFO L225 Difference]: With dead ends: 7707 [2023-12-19 01:39:48,562 INFO L226 Difference]: Without dead ends: 6033 [2023-12-19 01:39:48,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-12-19 01:39:48,569 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 1035 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:48,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 518 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-19 01:39:48,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2023-12-19 01:39:48,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 4943. [2023-12-19 01:39:48,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4943 states, 4092 states have (on average 1.4850928641251222) internal successors, (6077), 4168 states have internal predecessors, (6077), 496 states have call successors, (496), 306 states have call predecessors, (496), 354 states have return successors, (840), 484 states have call predecessors, (840), 496 states have call successors, (840) [2023-12-19 01:39:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4943 states to 4943 states and 7413 transitions. [2023-12-19 01:39:48,879 INFO L78 Accepts]: Start accepts. Automaton has 4943 states and 7413 transitions. Word has length 61 [2023-12-19 01:39:48,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:48,880 INFO L495 AbstractCegarLoop]: Abstraction has 4943 states and 7413 transitions. [2023-12-19 01:39:48,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:39:48,880 INFO L276 IsEmpty]: Start isEmpty. Operand 4943 states and 7413 transitions. [2023-12-19 01:39:48,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-19 01:39:48,888 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:48,888 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:48,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 01:39:48,888 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:48,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:48,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1954181422, now seen corresponding path program 1 times [2023-12-19 01:39:48,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:48,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701003768] [2023-12-19 01:39:48,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:48,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:48,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:48,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:48,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:39:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:48,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:39:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:48,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:39:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:48,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:39:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:48,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:48,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 01:39:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:48,979 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-19 01:39:48,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:48,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701003768] [2023-12-19 01:39:48,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701003768] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:39:48,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831470537] [2023-12-19 01:39:48,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:48,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:39:48,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:39:48,982 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:49,008 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:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:49,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:39:49,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:39:49,140 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-19 01:39:49,140 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:39:49,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831470537] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:49,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:39:49,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:39:49,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357668953] [2023-12-19 01:39:49,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:49,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:39:49,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:49,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:39:49,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:49,142 INFO L87 Difference]: Start difference. First operand 4943 states and 7413 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:39:49,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:49,529 INFO L93 Difference]: Finished difference Result 14513 states and 22084 transitions. [2023-12-19 01:39:49,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:39:49,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2023-12-19 01:39:49,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:49,594 INFO L225 Difference]: With dead ends: 14513 [2023-12-19 01:39:49,595 INFO L226 Difference]: Without dead ends: 9581 [2023-12-19 01:39:49,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:49,607 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 145 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:49,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 455 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:39:49,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9581 states. [2023-12-19 01:39:50,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9581 to 9581. [2023-12-19 01:39:50,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9581 states, 7939 states have (on average 1.4734853256077591) internal successors, (11698), 8064 states have internal predecessors, (11698), 943 states have call successors, (943), 600 states have call predecessors, (943), 698 states have return successors, (1803), 948 states have call predecessors, (1803), 943 states have call successors, (1803) [2023-12-19 01:39:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9581 states to 9581 states and 14444 transitions. [2023-12-19 01:39:50,174 INFO L78 Accepts]: Start accepts. Automaton has 9581 states and 14444 transitions. Word has length 99 [2023-12-19 01:39:50,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:50,174 INFO L495 AbstractCegarLoop]: Abstraction has 9581 states and 14444 transitions. [2023-12-19 01:39:50,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:39:50,175 INFO L276 IsEmpty]: Start isEmpty. Operand 9581 states and 14444 transitions. [2023-12-19 01:39:50,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-19 01:39:50,203 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:50,203 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:50,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-19 01:39:50,409 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,SelfDestructingSolverStorable11 [2023-12-19 01:39:50,410 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:50,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:50,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1921924436, now seen corresponding path program 1 times [2023-12-19 01:39:50,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:50,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438872706] [2023-12-19 01:39:50,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:50,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:39:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:39:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:39:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:39:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-19 01:39:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-19 01:39:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-19 01:39:50,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:50,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438872706] [2023-12-19 01:39:50,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438872706] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:39:50,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151326918] [2023-12-19 01:39:50,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:50,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:39:50,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:39:50,527 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:50,529 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:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:50,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:39:50,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:39:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-19 01:39:50,806 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:39:50,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151326918] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:50,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:39:50,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-19 01:39:50,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117382741] [2023-12-19 01:39:50,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:50,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:39:50,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:50,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:39:50,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:50,808 INFO L87 Difference]: Start difference. First operand 9581 states and 14444 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-19 01:39:51,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:51,385 INFO L93 Difference]: Finished difference Result 18033 states and 27484 transitions. [2023-12-19 01:39:51,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:39:51,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 127 [2023-12-19 01:39:51,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:51,452 INFO L225 Difference]: With dead ends: 18033 [2023-12-19 01:39:51,452 INFO L226 Difference]: Without dead ends: 12949 [2023-12-19 01:39:51,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:51,470 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 91 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 298 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:51,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 298 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:51,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12949 states. [2023-12-19 01:39:52,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12949 to 12859. [2023-12-19 01:39:52,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12859 states, 10655 states have (on average 1.4736743312998593) internal successors, (15702), 10821 states have internal predecessors, (15702), 1265 states have call successors, (1265), 808 states have call predecessors, (1265), 938 states have return successors, (2350), 1261 states have call predecessors, (2350), 1265 states have call successors, (2350) [2023-12-19 01:39:52,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12859 states to 12859 states and 19317 transitions. [2023-12-19 01:39:52,232 INFO L78 Accepts]: Start accepts. Automaton has 12859 states and 19317 transitions. Word has length 127 [2023-12-19 01:39:52,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:52,233 INFO L495 AbstractCegarLoop]: Abstraction has 12859 states and 19317 transitions. [2023-12-19 01:39:52,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-19 01:39:52,233 INFO L276 IsEmpty]: Start isEmpty. Operand 12859 states and 19317 transitions. [2023-12-19 01:39:52,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-19 01:39:52,258 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:52,258 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:52,271 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:52,465 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,SelfDestructingSolverStorable12 [2023-12-19 01:39:52,465 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:52,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:52,466 INFO L85 PathProgramCache]: Analyzing trace with hash 150453461, now seen corresponding path program 1 times [2023-12-19 01:39:52,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:52,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004446070] [2023-12-19 01:39:52,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:52,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:39:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:39:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:39:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:39:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-19 01:39:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-19 01:39:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-19 01:39:52,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:52,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004446070] [2023-12-19 01:39:52,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004446070] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:39:52,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038909384] [2023-12-19 01:39:52,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:52,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:39:52,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:39:52,556 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:52,580 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:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:52,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:39:52,657 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:39:52,735 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-19 01:39:52,735 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:39:52,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038909384] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:52,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:39:52,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-19 01:39:52,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434091563] [2023-12-19 01:39:52,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:52,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:39:52,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:52,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:39:52,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:52,737 INFO L87 Difference]: Start difference. First operand 12859 states and 19317 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-19 01:39:53,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:53,778 INFO L93 Difference]: Finished difference Result 38011 states and 57611 transitions. [2023-12-19 01:39:53,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:39:53,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 127 [2023-12-19 01:39:53,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:53,871 INFO L225 Difference]: With dead ends: 38011 [2023-12-19 01:39:53,872 INFO L226 Difference]: Without dead ends: 25167 [2023-12-19 01:39:53,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:53,910 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 95 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 301 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,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 301 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,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25167 states. [2023-12-19 01:39:55,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25167 to 25025. [2023-12-19 01:39:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25025 states, 20770 states have (on average 1.4655272026961965) internal successors, (30439), 21100 states have internal predecessors, (30439), 2411 states have call successors, (2411), 1580 states have call predecessors, (2411), 1843 states have return successors, (4394), 2376 states have call predecessors, (4394), 2411 states have call successors, (4394) [2023-12-19 01:39:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25025 states to 25025 states and 37244 transitions. [2023-12-19 01:39:55,432 INFO L78 Accepts]: Start accepts. Automaton has 25025 states and 37244 transitions. Word has length 127 [2023-12-19 01:39:55,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:55,432 INFO L495 AbstractCegarLoop]: Abstraction has 25025 states and 37244 transitions. [2023-12-19 01:39:55,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-19 01:39:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 25025 states and 37244 transitions. [2023-12-19 01:39:55,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-19 01:39:55,502 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:55,503 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:55,513 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:55,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:39:55,705 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:55,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:55,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1421012609, now seen corresponding path program 1 times [2023-12-19 01:39:55,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:55,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842615465] [2023-12-19 01:39:55,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:55,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:39:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:39:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:39:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 01:39:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 01:39:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 01:39:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:55,847 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 130 [2023-12-19 01:39:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,852 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-19 01:39:55,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:55,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842615465] [2023-12-19 01:39:55,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842615465] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:39:55,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117416772] [2023-12-19 01:39:55,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:55,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:39:55,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:39:55,857 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:55,880 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:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:55,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:39:55,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:39:56,036 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-19 01:39:56,036 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:39:56,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117416772] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:56,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:39:56,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:39:56,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536376213] [2023-12-19 01:39:56,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:56,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:39:56,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:56,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:39:56,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:56,039 INFO L87 Difference]: Start difference. First operand 25025 states and 37244 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-19 01:39:57,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:39:57,458 INFO L93 Difference]: Finished difference Result 47799 states and 71180 transitions. [2023-12-19 01:39:57,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:39:57,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 143 [2023-12-19 01:39:57,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:39:57,564 INFO L225 Difference]: With dead ends: 47799 [2023-12-19 01:39:57,564 INFO L226 Difference]: Without dead ends: 27003 [2023-12-19 01:39:57,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:57,605 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 125 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:39:57,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 339 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:39:57,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27003 states. [2023-12-19 01:39:58,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27003 to 26853. [2023-12-19 01:39:58,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26853 states, 22395 states have (on average 1.4332663540968966) internal successors, (32098), 22725 states have internal predecessors, (32098), 2455 states have call successors, (2455), 1732 states have call predecessors, (2455), 2002 states have return successors, (4744), 2427 states have call predecessors, (4744), 2455 states have call successors, (4744) [2023-12-19 01:39:59,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26853 states to 26853 states and 39297 transitions. [2023-12-19 01:39:59,029 INFO L78 Accepts]: Start accepts. Automaton has 26853 states and 39297 transitions. Word has length 143 [2023-12-19 01:39:59,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:39:59,030 INFO L495 AbstractCegarLoop]: Abstraction has 26853 states and 39297 transitions. [2023-12-19 01:39:59,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-19 01:39:59,030 INFO L276 IsEmpty]: Start isEmpty. Operand 26853 states and 39297 transitions. [2023-12-19 01:39:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-19 01:39:59,076 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:39:59,076 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:39:59,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-19 01:39:59,282 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,SelfDestructingSolverStorable14 [2023-12-19 01:39:59,283 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:39:59,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:39:59,283 INFO L85 PathProgramCache]: Analyzing trace with hash -631768685, now seen corresponding path program 1 times [2023-12-19 01:39:59,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:39:59,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810350225] [2023-12-19 01:39:59,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:59,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:39:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:59,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:39:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:59,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:39:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:59,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:39:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:59,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:39:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:59,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:39:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:59,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:39:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:59,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:59,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 01:39:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:59,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 01:39:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:59,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:39:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:59,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 01:39:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:59,381 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-19 01:39:59,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:39:59,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810350225] [2023-12-19 01:39:59,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810350225] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:39:59,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517460234] [2023-12-19 01:39:59,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:39:59,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:39:59,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:39:59,382 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:59,408 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:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:39:59,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:39:59,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:39:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-19 01:39:59,514 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:39:59,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517460234] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:39:59,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:39:59,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:39:59,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003888968] [2023-12-19 01:39:59,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:39:59,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:39:59,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:39:59,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:39:59,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:39:59,515 INFO L87 Difference]: Start difference. First operand 26853 states and 39297 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:40:01,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:40:01,808 INFO L93 Difference]: Finished difference Result 78995 states and 117344 transitions. [2023-12-19 01:40:01,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:40:01,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 144 [2023-12-19 01:40:01,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:40:02,037 INFO L225 Difference]: With dead ends: 78995 [2023-12-19 01:40:02,038 INFO L226 Difference]: Without dead ends: 52159 [2023-12-19 01:40:02,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:40:02,103 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 138 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:40:02,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 460 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:40:02,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52159 states. [2023-12-19 01:40:04,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52159 to 52115. [2023-12-19 01:40:04,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52115 states, 43391 states have (on average 1.421308566292549) internal successors, (61672), 44051 states have internal predecessors, (61672), 4773 states have call successors, (4773), 3404 states have call predecessors, (4773), 3950 states have return successors, (10768), 4723 states have call predecessors, (10768), 4773 states have call successors, (10768) [2023-12-19 01:40:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52115 states to 52115 states and 77213 transitions. [2023-12-19 01:40:05,044 INFO L78 Accepts]: Start accepts. Automaton has 52115 states and 77213 transitions. Word has length 144 [2023-12-19 01:40:05,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:40:05,044 INFO L495 AbstractCegarLoop]: Abstraction has 52115 states and 77213 transitions. [2023-12-19 01:40:05,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:40:05,045 INFO L276 IsEmpty]: Start isEmpty. Operand 52115 states and 77213 transitions. [2023-12-19 01:40:05,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-19 01:40:05,135 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:40:05,135 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:40:05,145 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:40:05,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-19 01:40:05,343 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:40:05,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:40:05,343 INFO L85 PathProgramCache]: Analyzing trace with hash -347641467, now seen corresponding path program 1 times [2023-12-19 01:40:05,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:40:05,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662035335] [2023-12-19 01:40:05,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:40:05,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:40:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:05,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:40:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:05,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:40:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:05,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:40:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:05,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:40:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:05,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:40:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:05,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:40:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:05,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:40:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:05,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 01:40:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:05,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 01:40:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:05,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:40:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:05,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 01:40:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:05,447 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-12-19 01:40:05,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:40:05,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662035335] [2023-12-19 01:40:05,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662035335] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:40:05,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422094605] [2023-12-19 01:40:05,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:40:05,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:40:05,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:40:05,448 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:40:05,464 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:40:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:05,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:40:05,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:40:05,628 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-19 01:40:05,628 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:40:05,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422094605] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:40:05,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:40:05,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:40:05,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813130263] [2023-12-19 01:40:05,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:40:05,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:40:05,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:40:05,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:40:05,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:40:05,630 INFO L87 Difference]: Start difference. First operand 52115 states and 77213 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-19 01:40:07,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:40:07,869 INFO L93 Difference]: Finished difference Result 88339 states and 132458 transitions. [2023-12-19 01:40:07,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:40:07,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 144 [2023-12-19 01:40:07,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:40:08,040 INFO L225 Difference]: With dead ends: 88339 [2023-12-19 01:40:08,040 INFO L226 Difference]: Without dead ends: 44313 [2023-12-19 01:40:08,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:40:08,145 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 111 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 01:40:08,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 182 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 01:40:08,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44313 states. [2023-12-19 01:40:09,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44313 to 32071. [2023-12-19 01:40:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32071 states, 26741 states have (on average 1.3718260349276392) internal successors, (36684), 27089 states have internal predecessors, (36684), 2917 states have call successors, (2917), 2128 states have call predecessors, (2917), 2412 states have return successors, (6088), 2885 states have call predecessors, (6088), 2917 states have call successors, (6088) [2023-12-19 01:40:10,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32071 states to 32071 states and 45689 transitions. [2023-12-19 01:40:10,117 INFO L78 Accepts]: Start accepts. Automaton has 32071 states and 45689 transitions. Word has length 144 [2023-12-19 01:40:10,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:40:10,117 INFO L495 AbstractCegarLoop]: Abstraction has 32071 states and 45689 transitions. [2023-12-19 01:40:10,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-19 01:40:10,117 INFO L276 IsEmpty]: Start isEmpty. Operand 32071 states and 45689 transitions. [2023-12-19 01:40:10,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-19 01:40:10,155 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:40:10,155 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:40:10,163 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:40:10,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-19 01:40:10,361 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:40:10,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:40:10,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1836703662, now seen corresponding path program 1 times [2023-12-19 01:40:10,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:40:10,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812440020] [2023-12-19 01:40:10,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:40:10,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:40:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:10,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:40:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:10,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:40:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:10,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:40:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:10,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:40:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:10,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:40:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:10,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:40:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:10,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 01:40:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:10,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:40:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:10,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-19 01:40:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:10,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:40:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:10,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-19 01:40:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-12-19 01:40:10,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:40:10,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812440020] [2023-12-19 01:40:10,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812440020] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:40:10,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044999690] [2023-12-19 01:40:10,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:40:10,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:40:10,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:40:10,453 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:40:10,456 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:40:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:10,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:40:10,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:40:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-19 01:40:10,639 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:40:10,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044999690] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:40:10,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:40:10,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:40:10,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333730781] [2023-12-19 01:40:10,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:40:10,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:40:10,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:40:10,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:40:10,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:40:10,641 INFO L87 Difference]: Start difference. First operand 32071 states and 45689 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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:40:13,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:40:13,473 INFO L93 Difference]: Finished difference Result 94689 states and 138489 transitions. [2023-12-19 01:40:13,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:40:13,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 145 [2023-12-19 01:40:13,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:40:13,697 INFO L225 Difference]: With dead ends: 94689 [2023-12-19 01:40:13,698 INFO L226 Difference]: Without dead ends: 62643 [2023-12-19 01:40:13,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:40:13,759 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 132 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 01:40:13,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 324 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 01:40:13,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62643 states. [2023-12-19 01:40:16,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62643 to 62381. [2023-12-19 01:40:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62381 states, 51925 states have (on average 1.358613384689456) internal successors, (70546), 52621 states have internal predecessors, (70546), 5689 states have call successors, (5689), 4184 states have call predecessors, (5689), 4766 states have return successors, (15334), 5639 states have call predecessors, (15334), 5689 states have call successors, (15334) [2023-12-19 01:40:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62381 states to 62381 states and 91569 transitions. [2023-12-19 01:40:17,164 INFO L78 Accepts]: Start accepts. Automaton has 62381 states and 91569 transitions. Word has length 145 [2023-12-19 01:40:17,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:40:17,164 INFO L495 AbstractCegarLoop]: Abstraction has 62381 states and 91569 transitions. [2023-12-19 01:40:17,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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:40:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 62381 states and 91569 transitions. [2023-12-19 01:40:17,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-19 01:40:17,241 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:40:17,242 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:40:17,250 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:40:17,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:40:17,447 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:40:17,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:40:17,448 INFO L85 PathProgramCache]: Analyzing trace with hash -433075375, now seen corresponding path program 1 times [2023-12-19 01:40:17,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:40:17,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066559871] [2023-12-19 01:40:17,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:40:17,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:40:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:17,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:40:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:17,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:40:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:17,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:40:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:17,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:40:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:17,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:40:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:17,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:40:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:17,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:40:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:17,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 01:40:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:17,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 01:40:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:17,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:40:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:17,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-19 01:40:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-19 01:40:17,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:40:17,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066559871] [2023-12-19 01:40:17,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066559871] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:40:17,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419966759] [2023-12-19 01:40:17,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:40:17,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:40:17,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:40:17,521 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:40:17,560 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:40:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:17,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:40:17,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:40:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-19 01:40:17,672 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:40:17,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419966759] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:40:17,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:40:17,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:40:17,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824200388] [2023-12-19 01:40:17,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:40:17,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:40:17,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:40:17,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:40:17,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:40:17,675 INFO L87 Difference]: Start difference. First operand 62381 states and 91569 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:40:20,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:40:20,478 INFO L93 Difference]: Finished difference Result 118533 states and 178073 transitions. [2023-12-19 01:40:20,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:40:20,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 145 [2023-12-19 01:40:20,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:40:20,899 INFO L225 Difference]: With dead ends: 118533 [2023-12-19 01:40:20,900 INFO L226 Difference]: Without dead ends: 61443 [2023-12-19 01:40:20,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:40:20,998 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 132 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:40:20,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 186 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:40:21,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61443 states. [2023-12-19 01:40:24,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61443 to 56451. [2023-12-19 01:40:24,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56451 states, 47013 states have (on average 1.3137855486780252) internal successors, (61765), 47585 states have internal predecessors, (61765), 5185 states have call successors, (5185), 3792 states have call predecessors, (5185), 4252 states have return successors, (12103), 5105 states have call predecessors, (12103), 5185 states have call successors, (12103) [2023-12-19 01:40:24,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56451 states to 56451 states and 79053 transitions. [2023-12-19 01:40:24,288 INFO L78 Accepts]: Start accepts. Automaton has 56451 states and 79053 transitions. Word has length 145 [2023-12-19 01:40:24,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:40:24,288 INFO L495 AbstractCegarLoop]: Abstraction has 56451 states and 79053 transitions. [2023-12-19 01:40:24,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:40:24,289 INFO L276 IsEmpty]: Start isEmpty. Operand 56451 states and 79053 transitions. [2023-12-19 01:40:24,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-19 01:40:24,344 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:40:24,344 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:40:24,351 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:40:24,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:40:24,546 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:40:24,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:40:24,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1547494798, now seen corresponding path program 1 times [2023-12-19 01:40:24,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:40:24,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346538820] [2023-12-19 01:40:24,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:40:24,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:40:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:24,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:40:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:24,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:40:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:24,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:40:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:24,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:40:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:24,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:40:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:24,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:40:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:24,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:40:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:24,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 01:40:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:24,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 01:40:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:24,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:40:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:24,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-19 01:40:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-19 01:40:24,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:40:24,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346538820] [2023-12-19 01:40:24,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346538820] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:40:24,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987547158] [2023-12-19 01:40:24,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:40:24,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:40:24,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:40:24,632 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:40:24,664 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:40:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:24,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:40:24,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:40:24,752 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-19 01:40:24,752 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:40:24,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987547158] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:40:24,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:40:24,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:40:24,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102244882] [2023-12-19 01:40:24,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:40:24,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:40:24,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:40:24,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:40:24,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:40:24,755 INFO L87 Difference]: Start difference. First operand 56451 states and 79053 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:40:27,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:40:27,803 INFO L93 Difference]: Finished difference Result 101903 states and 142153 transitions. [2023-12-19 01:40:27,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:40:27,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 145 [2023-12-19 01:40:27,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:40:27,971 INFO L225 Difference]: With dead ends: 101903 [2023-12-19 01:40:27,972 INFO L226 Difference]: Without dead ends: 58241 [2023-12-19 01:40:28,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:40:28,034 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 140 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:40:28,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 423 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:40:28,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58241 states. [2023-12-19 01:40:30,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58241 to 58239. [2023-12-19 01:40:30,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58239 states, 48701 states have (on average 1.3042647994907701) internal successors, (63519), 49301 states have internal predecessors, (63519), 5185 states have call successors, (5185), 3864 states have call predecessors, (5185), 4352 states have return successors, (11653), 5105 states have call predecessors, (11653), 5185 states have call successors, (11653) [2023-12-19 01:40:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58239 states to 58239 states and 80357 transitions. [2023-12-19 01:40:31,129 INFO L78 Accepts]: Start accepts. Automaton has 58239 states and 80357 transitions. Word has length 145 [2023-12-19 01:40:31,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:40:31,129 INFO L495 AbstractCegarLoop]: Abstraction has 58239 states and 80357 transitions. [2023-12-19 01:40:31,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:40:31,129 INFO L276 IsEmpty]: Start isEmpty. Operand 58239 states and 80357 transitions. [2023-12-19 01:40:31,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-19 01:40:31,179 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:40:31,179 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:40:31,185 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:40:31,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:40:31,385 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:40:31,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:40:31,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1404299474, now seen corresponding path program 1 times [2023-12-19 01:40:31,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:40:31,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999444913] [2023-12-19 01:40:31,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:40:31,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:40:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:31,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:40:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:31,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:40:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:31,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:40:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:31,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:40:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:31,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:40:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:31,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:40:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:31,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 01:40:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:31,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:40:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:31,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-19 01:40:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:31,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:40:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:31,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-19 01:40:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:31,451 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-19 01:40:31,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:40:31,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999444913] [2023-12-19 01:40:31,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999444913] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:40:31,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:40:31,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 01:40:31,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202494379] [2023-12-19 01:40:31,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:40:31,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:40:31,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:40:31,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:40:31,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:40:31,452 INFO L87 Difference]: Start difference. First operand 58239 states and 80357 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-19 01:40:34,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:40:34,265 INFO L93 Difference]: Finished difference Result 115569 states and 158767 transitions. [2023-12-19 01:40:34,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 01:40:34,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 145 [2023-12-19 01:40:34,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:40:34,442 INFO L225 Difference]: With dead ends: 115569 [2023-12-19 01:40:34,442 INFO L226 Difference]: Without dead ends: 57351 [2023-12-19 01:40:34,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:40:34,535 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 276 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:40:34,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 206 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:40:34,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57351 states. [2023-12-19 01:40:36,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57351 to 52818. [2023-12-19 01:40:36,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52818 states, 44553 states have (on average 1.3078356115188652) internal successors, (58268), 45645 states have internal predecessors, (58268), 4001 states have call successors, (4001), 2988 states have call predecessors, (4001), 4263 states have return successors, (10337), 4200 states have call predecessors, (10337), 4001 states have call successors, (10337) [2023-12-19 01:40:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52818 states to 52818 states and 72606 transitions. [2023-12-19 01:40:37,305 INFO L78 Accepts]: Start accepts. Automaton has 52818 states and 72606 transitions. Word has length 145 [2023-12-19 01:40:37,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:40:37,305 INFO L495 AbstractCegarLoop]: Abstraction has 52818 states and 72606 transitions. [2023-12-19 01:40:37,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-19 01:40:37,305 INFO L276 IsEmpty]: Start isEmpty. Operand 52818 states and 72606 transitions. [2023-12-19 01:40:37,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-19 01:40:37,339 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:40:37,339 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:40:37,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-19 01:40:37,340 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:40:37,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:40:37,340 INFO L85 PathProgramCache]: Analyzing trace with hash 158361844, now seen corresponding path program 1 times [2023-12-19 01:40:37,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:40:37,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105687799] [2023-12-19 01:40:37,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:40:37,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:40:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:37,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:40:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:37,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:40:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:37,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:40:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:37,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:40:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:37,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:40:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:37,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:40:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:37,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 01:40:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:37,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:40:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:37,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 01:40:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:37,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:40:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:37,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-12-19 01:40:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:37,429 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-19 01:40:37,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:40:37,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105687799] [2023-12-19 01:40:37,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105687799] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:40:37,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907107961] [2023-12-19 01:40:37,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:40:37,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:40:37,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:40:37,431 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:40:37,448 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:40:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:37,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:40:37,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:40:37,570 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-19 01:40:37,570 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:40:37,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907107961] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:40:37,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:40:37,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:40:37,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632239494] [2023-12-19 01:40:37,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:40:37,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:40:37,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:40:37,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:40:37,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:40:37,572 INFO L87 Difference]: Start difference. First operand 52818 states and 72606 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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:40:39,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:40:39,769 INFO L93 Difference]: Finished difference Result 93915 states and 129447 transitions. [2023-12-19 01:40:39,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:40:39,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 146 [2023-12-19 01:40:39,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:40:39,958 INFO L225 Difference]: With dead ends: 93915 [2023-12-19 01:40:39,959 INFO L226 Difference]: Without dead ends: 53468 [2023-12-19 01:40:40,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:40:40,028 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 128 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:40:40,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 305 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:40:40,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53468 states. [2023-12-19 01:40:42,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53468 to 52818. [2023-12-19 01:40:42,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52818 states, 44553 states have (on average 1.3017080780194374) internal successors, (57995), 45645 states have internal predecessors, (57995), 4001 states have call successors, (4001), 2988 states have call predecessors, (4001), 4263 states have return successors, (10337), 4200 states have call predecessors, (10337), 4001 states have call successors, (10337) [2023-12-19 01:40:42,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52818 states to 52818 states and 72333 transitions. [2023-12-19 01:40:42,677 INFO L78 Accepts]: Start accepts. Automaton has 52818 states and 72333 transitions. Word has length 146 [2023-12-19 01:40:42,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:40:42,677 INFO L495 AbstractCegarLoop]: Abstraction has 52818 states and 72333 transitions. [2023-12-19 01:40:42,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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:40:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 52818 states and 72333 transitions. [2023-12-19 01:40:42,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-19 01:40:42,720 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:40:42,720 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:40:42,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:40:42,921 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,SelfDestructingSolverStorable21 [2023-12-19 01:40:42,921 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:40:42,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:40:42,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1196277840, now seen corresponding path program 1 times [2023-12-19 01:40:42,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:40:42,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114734825] [2023-12-19 01:40:42,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:40:42,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:40:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:42,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:40:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:42,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:40:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:42,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:40:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:42,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:40:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:42,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:40:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:42,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:40:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:42,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 01:40:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:42,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:40:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:42,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 01:40:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:42,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:40:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:42,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-12-19 01:40:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:42,972 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-19 01:40:42,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:40:42,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114734825] [2023-12-19 01:40:42,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114734825] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:40:42,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:40:42,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 01:40:42,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216039786] [2023-12-19 01:40:42,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:40:42,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:40:42,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:40:42,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:40:42,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:40:42,974 INFO L87 Difference]: Start difference. First operand 52818 states and 72333 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-19 01:40:45,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:40:45,019 INFO L93 Difference]: Finished difference Result 96324 states and 131588 transitions. [2023-12-19 01:40:45,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 01:40:45,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 146 [2023-12-19 01:40:45,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:40:45,112 INFO L225 Difference]: With dead ends: 96324 [2023-12-19 01:40:45,113 INFO L226 Difference]: Without dead ends: 43521 [2023-12-19 01:40:45,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:40:45,166 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 274 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:40:45,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 204 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:40:45,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43521 states. [2023-12-19 01:40:47,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43521 to 39806. [2023-12-19 01:40:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39806 states, 33665 states have (on average 1.3123124907173622) internal successors, (44179), 34445 states have internal predecessors, (44179), 2985 states have call successors, (2985), 2244 states have call predecessors, (2985), 3155 states have return successors, (7317), 3124 states have call predecessors, (7317), 2985 states have call successors, (7317) [2023-12-19 01:40:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39806 states to 39806 states and 54481 transitions. [2023-12-19 01:40:47,175 INFO L78 Accepts]: Start accepts. Automaton has 39806 states and 54481 transitions. Word has length 146 [2023-12-19 01:40:47,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:40:47,176 INFO L495 AbstractCegarLoop]: Abstraction has 39806 states and 54481 transitions. [2023-12-19 01:40:47,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-19 01:40:47,176 INFO L276 IsEmpty]: Start isEmpty. Operand 39806 states and 54481 transitions. [2023-12-19 01:40:47,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-19 01:40:47,208 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:40:47,208 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:40:47,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-19 01:40:47,208 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:40:47,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:40:47,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1213259920, now seen corresponding path program 1 times [2023-12-19 01:40:47,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:40:47,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67404542] [2023-12-19 01:40:47,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:40:47,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:40:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:47,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:40:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:47,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:40:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:47,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:40:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:47,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:40:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:47,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:40:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:47,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:40:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:47,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:40:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:47,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:40:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:47,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 01:40:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:47,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:40:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:47,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-19 01:40:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:47,292 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-19 01:40:47,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:40:47,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67404542] [2023-12-19 01:40:47,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67404542] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:40:47,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048234095] [2023-12-19 01:40:47,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:40:47,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:40:47,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:40:47,293 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:40:47,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-19 01:40:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:47,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:40:47,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:40:47,416 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-19 01:40:47,416 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:40:47,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048234095] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:40:47,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:40:47,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:40:47,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478989514] [2023-12-19 01:40:47,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:40:47,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:40:47,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:40:47,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:40:47,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:40:47,418 INFO L87 Difference]: Start difference. First operand 39806 states and 54481 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:40:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:40:49,155 INFO L93 Difference]: Finished difference Result 66895 states and 95786 transitions. [2023-12-19 01:40:49,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:40:49,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 149 [2023-12-19 01:40:49,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:40:49,262 INFO L225 Difference]: With dead ends: 66895 [2023-12-19 01:40:49,263 INFO L226 Difference]: Without dead ends: 39916 [2023-12-19 01:40:49,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 170 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:40:49,303 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 120 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:40:49,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 412 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:40:49,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39916 states. [2023-12-19 01:40:51,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39916 to 39806. [2023-12-19 01:40:51,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39806 states, 33665 states have (on average 1.2839150452992723) internal successors, (43223), 34445 states have internal predecessors, (43223), 2985 states have call successors, (2985), 2244 states have call predecessors, (2985), 3155 states have return successors, (7317), 3124 states have call predecessors, (7317), 2985 states have call successors, (7317) [2023-12-19 01:40:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39806 states to 39806 states and 53525 transitions. [2023-12-19 01:40:51,327 INFO L78 Accepts]: Start accepts. Automaton has 39806 states and 53525 transitions. Word has length 149 [2023-12-19 01:40:51,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:40:51,327 INFO L495 AbstractCegarLoop]: Abstraction has 39806 states and 53525 transitions. [2023-12-19 01:40:51,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:40:51,328 INFO L276 IsEmpty]: Start isEmpty. Operand 39806 states and 53525 transitions. [2023-12-19 01:40:51,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-19 01:40:51,359 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:40:51,360 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:40:51,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-19 01:40:51,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-19 01:40:51,560 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:40:51,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:40:51,561 INFO L85 PathProgramCache]: Analyzing trace with hash 334208112, now seen corresponding path program 1 times [2023-12-19 01:40:51,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:40:51,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526923282] [2023-12-19 01:40:51,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:40:51,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:40:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:51,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:40:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:51,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:40:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:51,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:40:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:51,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:40:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:51,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:40:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:51,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:40:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:51,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:40:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:51,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:40:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:51,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 01:40:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:51,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:40:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:51,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-19 01:40:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:51,632 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-19 01:40:51,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:40:51,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526923282] [2023-12-19 01:40:51,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526923282] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:40:51,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456717305] [2023-12-19 01:40:51,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:40:51,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:40:51,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:40:51,634 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:40:51,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-19 01:40:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:51,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:40:51,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:40:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-19 01:40:51,888 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:40:51,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456717305] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:40:51,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:40:51,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:40:51,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389056947] [2023-12-19 01:40:51,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:40:51,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:40:51,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:40:51,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:40:51,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:40:51,890 INFO L87 Difference]: Start difference. First operand 39806 states and 53525 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-19 01:40:53,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:40:53,493 INFO L93 Difference]: Finished difference Result 72964 states and 101831 transitions. [2023-12-19 01:40:53,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:40:53,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 149 [2023-12-19 01:40:53,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:40:53,586 INFO L225 Difference]: With dead ends: 72964 [2023-12-19 01:40:53,586 INFO L226 Difference]: Without dead ends: 37381 [2023-12-19 01:40:53,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 170 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:40:53,640 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 118 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:40:53,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 174 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:40:53,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37381 states. [2023-12-19 01:40:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37381 to 22245. [2023-12-19 01:40:54,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22245 states, 18835 states have (on average 1.2415184496947174) internal successors, (23384), 19252 states have internal predecessors, (23384), 1649 states have call successors, (1649), 1248 states have call predecessors, (1649), 1760 states have return successors, (3561), 1748 states have call predecessors, (3561), 1649 states have call successors, (3561) [2023-12-19 01:40:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22245 states to 22245 states and 28594 transitions. [2023-12-19 01:40:54,957 INFO L78 Accepts]: Start accepts. Automaton has 22245 states and 28594 transitions. Word has length 149 [2023-12-19 01:40:54,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:40:54,957 INFO L495 AbstractCegarLoop]: Abstraction has 22245 states and 28594 transitions. [2023-12-19 01:40:54,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-19 01:40:54,958 INFO L276 IsEmpty]: Start isEmpty. Operand 22245 states and 28594 transitions. [2023-12-19 01:40:54,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-19 01:40:54,970 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:40:54,970 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:40:54,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-19 01:40:55,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-19 01:40:55,171 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:40:55,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:40:55,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1245110550, now seen corresponding path program 1 times [2023-12-19 01:40:55,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:40:55,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838588091] [2023-12-19 01:40:55,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:40:55,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:40:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:55,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:40:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:55,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:40:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:55,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:40:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:55,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:40:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:55,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:40:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:55,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:40:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:55,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:40:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:55,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:40:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:55,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 01:40:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:55,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:40:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:55,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 01:40:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:55,250 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-19 01:40:55,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:40:55,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838588091] [2023-12-19 01:40:55,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838588091] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:40:55,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20853176] [2023-12-19 01:40:55,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:40:55,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:40:55,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:40:55,253 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:40:55,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-19 01:40:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:55,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:40:55,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:40:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-19 01:40:55,392 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:40:55,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20853176] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:40:55,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:40:55,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:40:55,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324639196] [2023-12-19 01:40:55,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:40:55,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:40:55,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:40:55,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:40:55,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:40:55,393 INFO L87 Difference]: Start difference. First operand 22245 states and 28594 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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:40:56,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:40:56,641 INFO L93 Difference]: Finished difference Result 36039 states and 48214 transitions. [2023-12-19 01:40:56,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:40:56,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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 150 [2023-12-19 01:40:56,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:40:56,685 INFO L225 Difference]: With dead ends: 36039 [2023-12-19 01:40:56,685 INFO L226 Difference]: Without dead ends: 21891 [2023-12-19 01:40:56,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 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:40:56,707 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 96 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:40:56,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 372 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:40:56,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21891 states. [2023-12-19 01:40:57,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21891 to 21717. [2023-12-19 01:40:57,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21717 states, 18373 states have (on average 1.2156969466064333) internal successors, (22336), 18757 states have internal predecessors, (22336), 1649 states have call successors, (1649), 1248 states have call predecessors, (1649), 1694 states have return successors, (3457), 1715 states have call predecessors, (3457), 1649 states have call successors, (3457) [2023-12-19 01:40:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21717 states to 21717 states and 27442 transitions. [2023-12-19 01:40:57,836 INFO L78 Accepts]: Start accepts. Automaton has 21717 states and 27442 transitions. Word has length 150 [2023-12-19 01:40:57,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:40:57,837 INFO L495 AbstractCegarLoop]: Abstraction has 21717 states and 27442 transitions. [2023-12-19 01:40:57,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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:40:57,837 INFO L276 IsEmpty]: Start isEmpty. Operand 21717 states and 27442 transitions. [2023-12-19 01:40:57,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-19 01:40:57,850 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:40:57,850 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:40:57,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-19 01:40:58,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-19 01:40:58,051 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:40:58,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:40:58,051 INFO L85 PathProgramCache]: Analyzing trace with hash -95076906, now seen corresponding path program 1 times [2023-12-19 01:40:58,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:40:58,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470946024] [2023-12-19 01:40:58,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:40:58,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:40:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:58,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:40:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:58,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:40:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:58,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:40:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:58,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:40:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:58,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:40:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:58,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:40:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:58,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:40:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:58,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:40:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:58,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 01:40:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:58,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:40:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:58,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-19 01:40:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-19 01:40:58,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:40:58,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470946024] [2023-12-19 01:40:58,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470946024] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:40:58,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260277302] [2023-12-19 01:40:58,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:40:58,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:40:58,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:40:58,137 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:40:58,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-19 01:40:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:40:58,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 01:40:58,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:40:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-19 01:40:58,318 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:40:58,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260277302] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:40:58,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:40:58,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-19 01:40:58,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959417745] [2023-12-19 01:40:58,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:40:58,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:40:58,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:40:58,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:40:58,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:40:58,320 INFO L87 Difference]: Start difference. First operand 21717 states and 27442 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:40:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:40:59,352 INFO L93 Difference]: Finished difference Result 32739 states and 41823 transitions. [2023-12-19 01:40:59,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:40:59,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 151 [2023-12-19 01:40:59,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:40:59,402 INFO L225 Difference]: With dead ends: 32739 [2023-12-19 01:40:59,402 INFO L226 Difference]: Without dead ends: 17374 [2023-12-19 01:40:59,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:40:59,427 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 166 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 01:40:59,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 233 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 01:40:59,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17374 states. [2023-12-19 01:41:00,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17374 to 12812. [2023-12-19 01:41:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12812 states, 10866 states have (on average 1.1957482054113748) internal successors, (12993), 11076 states have internal predecessors, (12993), 975 states have call successors, (975), 722 states have call predecessors, (975), 970 states have return successors, (2067), 1015 states have call predecessors, (2067), 975 states have call successors, (2067) [2023-12-19 01:41:00,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12812 states to 12812 states and 16035 transitions. [2023-12-19 01:41:00,291 INFO L78 Accepts]: Start accepts. Automaton has 12812 states and 16035 transitions. Word has length 151 [2023-12-19 01:41:00,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:41:00,292 INFO L495 AbstractCegarLoop]: Abstraction has 12812 states and 16035 transitions. [2023-12-19 01:41:00,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:41:00,292 INFO L276 IsEmpty]: Start isEmpty. Operand 12812 states and 16035 transitions. [2023-12-19 01:41:00,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-19 01:41:00,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:41:00,298 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:41:00,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-19 01:41:00,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:41:00,504 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:41:00,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:41:00,505 INFO L85 PathProgramCache]: Analyzing trace with hash 376279444, now seen corresponding path program 1 times [2023-12-19 01:41:00,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:41:00,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167705968] [2023-12-19 01:41:00,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:41:00,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:41:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:00,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:41:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:00,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:41:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:00,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:41:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:00,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:41:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:00,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:41:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:00,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:41:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:00,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:41:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:00,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:41:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:00,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 01:41:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:00,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:41:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:00,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-19 01:41:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-19 01:41:00,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:41:00,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167705968] [2023-12-19 01:41:00,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167705968] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:41:00,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127404322] [2023-12-19 01:41:00,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:41:00,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:41:00,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:41:00,606 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:41:00,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-19 01:41:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:00,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-19 01:41:00,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:41:00,722 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-19 01:41:00,723 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:41:00,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127404322] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:41:00,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:41:00,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-19 01:41:00,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278034105] [2023-12-19 01:41:00,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:41:00,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:41:00,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:41:00,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:41:00,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:41:00,727 INFO L87 Difference]: Start difference. First operand 12812 states and 16035 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:41:01,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:41:01,335 INFO L93 Difference]: Finished difference Result 22576 states and 28754 transitions. [2023-12-19 01:41:01,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:41:01,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 151 [2023-12-19 01:41:01,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:41:01,353 INFO L225 Difference]: With dead ends: 22576 [2023-12-19 01:41:01,354 INFO L226 Difference]: Without dead ends: 7890 [2023-12-19 01:41:01,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:41:01,376 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 20 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:41:01,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 430 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:41:01,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7890 states. [2023-12-19 01:41:01,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7890 to 7668. [2023-12-19 01:41:01,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7668 states, 6458 states have (on average 1.1735831526788478) internal successors, (7579), 6580 states have internal predecessors, (7579), 609 states have call successors, (609), 457 states have call predecessors, (609), 600 states have return successors, (1087), 631 states have call predecessors, (1087), 609 states have call successors, (1087) [2023-12-19 01:41:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7668 states to 7668 states and 9275 transitions. [2023-12-19 01:41:01,868 INFO L78 Accepts]: Start accepts. Automaton has 7668 states and 9275 transitions. Word has length 151 [2023-12-19 01:41:01,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:41:01,868 INFO L495 AbstractCegarLoop]: Abstraction has 7668 states and 9275 transitions. [2023-12-19 01:41:01,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:41:01,868 INFO L276 IsEmpty]: Start isEmpty. Operand 7668 states and 9275 transitions. [2023-12-19 01:41:01,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-19 01:41:01,871 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:41:01,871 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:41:01,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-19 01:41:02,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-19 01:41:02,078 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:41:02,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:41:02,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1491663802, now seen corresponding path program 1 times [2023-12-19 01:41:02,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:41:02,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052647753] [2023-12-19 01:41:02,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:41:02,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:41:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:02,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:41:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:02,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:41:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:02,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:41:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:02,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:41:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:02,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:41:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:02,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:41:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:02,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:41:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:02,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:41:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:02,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:41:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:02,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:41:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:02,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-19 01:41:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:02,179 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-19 01:41:02,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:41:02,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052647753] [2023-12-19 01:41:02,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052647753] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:41:02,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582824157] [2023-12-19 01:41:02,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:41:02,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:41:02,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:41:02,184 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:41:02,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-19 01:41:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:02,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-19 01:41:02,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:41:02,285 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-19 01:41:02,285 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:41:02,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582824157] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:41:02,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:41:02,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-19 01:41:02,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162931991] [2023-12-19 01:41:02,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:41:02,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:41:02,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:41:02,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:41:02,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:41:02,287 INFO L87 Difference]: Start difference. First operand 7668 states and 9275 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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:41:02,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:41:02,719 INFO L93 Difference]: Finished difference Result 14466 states and 17866 transitions. [2023-12-19 01:41:02,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:41:02,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 151 [2023-12-19 01:41:02,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:41:02,735 INFO L225 Difference]: With dead ends: 14466 [2023-12-19 01:41:02,735 INFO L226 Difference]: Without dead ends: 6808 [2023-12-19 01:41:02,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:41:02,747 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 11 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:41:02,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 429 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:41:02,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6808 states. [2023-12-19 01:41:03,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6808 to 6788. [2023-12-19 01:41:03,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6788 states, 5693 states have (on average 1.1531705603372562) internal successors, (6565), 5797 states have internal predecessors, (6565), 557 states have call successors, (557), 416 states have call predecessors, (557), 537 states have return successors, (932), 575 states have call predecessors, (932), 557 states have call successors, (932) [2023-12-19 01:41:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6788 states to 6788 states and 8054 transitions. [2023-12-19 01:41:03,141 INFO L78 Accepts]: Start accepts. Automaton has 6788 states and 8054 transitions. Word has length 151 [2023-12-19 01:41:03,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:41:03,141 INFO L495 AbstractCegarLoop]: Abstraction has 6788 states and 8054 transitions. [2023-12-19 01:41:03,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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:41:03,141 INFO L276 IsEmpty]: Start isEmpty. Operand 6788 states and 8054 transitions. [2023-12-19 01:41:03,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-19 01:41:03,143 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:41:03,143 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:41:03,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-19 01:41:03,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-19 01:41:03,344 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:41:03,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:41:03,344 INFO L85 PathProgramCache]: Analyzing trace with hash -194294648, now seen corresponding path program 1 times [2023-12-19 01:41:03,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:41:03,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748604483] [2023-12-19 01:41:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:41:03,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:41:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:03,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:41:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:03,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:41:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:03,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:41:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:03,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:41:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:03,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:41:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:03,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:41:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:03,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:41:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:03,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:41:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:03,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:41:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:03,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:41:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:03,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-19 01:41:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:03,421 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-12-19 01:41:03,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:41:03,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748604483] [2023-12-19 01:41:03,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748604483] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:41:03,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835659071] [2023-12-19 01:41:03,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:41:03,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:41:03,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:41:03,422 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:41:03,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-19 01:41:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:03,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-19 01:41:03,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:41:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-19 01:41:03,521 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:41:03,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835659071] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:41:03,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:41:03,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-19 01:41:03,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129527738] [2023-12-19 01:41:03,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:41:03,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:41:03,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:41:03,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:41:03,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:41:03,523 INFO L87 Difference]: Start difference. First operand 6788 states and 8054 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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:41:03,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:41:03,702 INFO L93 Difference]: Finished difference Result 9641 states and 11452 transitions. [2023-12-19 01:41:03,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:41:03,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 151 [2023-12-19 01:41:03,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:41:03,706 INFO L225 Difference]: With dead ends: 9641 [2023-12-19 01:41:03,707 INFO L226 Difference]: Without dead ends: 1889 [2023-12-19 01:41:03,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:41:03,715 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 2 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:41:03,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 430 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:41:03,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2023-12-19 01:41:03,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1889. [2023-12-19 01:41:03,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1588 states have (on average 1.1272040302267003) internal successors, (1790), 1599 states have internal predecessors, (1790), 172 states have call successors, (172), 120 states have call predecessors, (172), 128 states have return successors, (187), 170 states have call predecessors, (187), 172 states have call successors, (187) [2023-12-19 01:41:03,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2149 transitions. [2023-12-19 01:41:03,826 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2149 transitions. Word has length 151 [2023-12-19 01:41:03,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:41:03,826 INFO L495 AbstractCegarLoop]: Abstraction has 1889 states and 2149 transitions. [2023-12-19 01:41:03,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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:41:03,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2149 transitions. [2023-12-19 01:41:03,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-19 01:41:03,828 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:41:03,828 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:41:03,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-12-19 01:41:04,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:41:04,034 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:41:04,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:41:04,035 INFO L85 PathProgramCache]: Analyzing trace with hash 861655127, now seen corresponding path program 1 times [2023-12-19 01:41:04,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:41:04,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044031230] [2023-12-19 01:41:04,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:41:04,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:41:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:04,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:41:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:04,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:41:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:04,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:41:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:04,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:41:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:04,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:41:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:04,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 01:41:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:04,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 01:41:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:04,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:41:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:04,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:41:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:04,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:41:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:04,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-19 01:41:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:04,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:41:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:04,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-19 01:41:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:41:04,169 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-19 01:41:04,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:41:04,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044031230] [2023-12-19 01:41:04,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044031230] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:41:04,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:41:04,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:41:04,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202499044] [2023-12-19 01:41:04,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:41:04,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:41:04,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:41:04,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:41:04,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:41:04,171 INFO L87 Difference]: Start difference. First operand 1889 states and 2149 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-19 01:41:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:41:04,884 INFO L93 Difference]: Finished difference Result 2287 states and 2583 transitions. [2023-12-19 01:41:04,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 01:41:04,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 183 [2023-12-19 01:41:04,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:41:04,884 INFO L225 Difference]: With dead ends: 2287 [2023-12-19 01:41:04,885 INFO L226 Difference]: Without dead ends: 0 [2023-12-19 01:41:04,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2023-12-19 01:41:04,891 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 645 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:41:04,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 639 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:41:04,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-19 01:41:04,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-19 01:41:04,892 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:41:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-19 01:41:04,892 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 183 [2023-12-19 01:41:04,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:41:04,892 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-19 01:41:04,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-19 01:41:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-19 01:41:04,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-19 01:41:04,894 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-19 01:41:04,895 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-19 01:41:04,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-19 01:41:04,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-19 01:41:58,086 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 1029 1039) no Hoare annotation was computed. [2023-12-19 01:41:58,086 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 1029 1039) no Hoare annotation was computed. [2023-12-19 01:41:58,087 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1029 1039) the Hoare annotation is: (let ((.cse28 (= |old(~t2_st~0)| ~t2_st~0)) (.cse25 (= ~t1_st~0 0)) (.cse27 (= |old(~t1_st~0)| ~t1_st~0)) (.cse24 (= ~m_st~0 |old(~m_st~0)|)) (.cse26 (= 0 ~t2_st~0))) (let ((.cse23 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0)))) (.cse11 (and .cse27 .cse24 .cse26)) (.cse22 (and .cse24 .cse28 .cse25)) (.cse9 (= ~m_pc~0 1)) (.cse15 (< |old(~m_st~0)| 2)) (.cse16 (< ~E_1~0 2)) (.cse18 (not (= |old(~t1_st~0)| 0))) (.cse19 (not (= ~m_pc~0 ~t1_pc~0))) (.cse20 (< 0 ~t1_pc~0)) (.cse3 (not (= |old(~t2_st~0)| 0))) (.cse10 (< 0 ~t2_pc~0)) (.cse0 (< ~T1_E~0 2)) (.cse1 (not (= ~t2_i~0 1))) (.cse2 (< ~E_2~0 2)) (.cse14 (and .cse27 .cse24 .cse28)) (.cse4 (< |old(~t1_st~0)| 2)) (.cse5 (not (= ~t1_pc~0 1))) (.cse6 (< ~E_M~0 2)) (.cse21 (< |old(~t2_st~0)| 2)) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse12 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse17 (not (= ~t2_pc~0 1))) (.cse13 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse14 .cse4 .cse5 .cse7 .cse8 .cse9 .cse15 .cse12 .cse16 .cse17) (or .cse0 .cse18 .cse19 .cse20 .cse1 .cse2 .cse6 .cse21 .cse22 .cse7 .cse8 .cse12 .cse17) (or .cse0 .cse1 .cse14 .cse5 .cse6 .cse21 .cse7 .cse23 .cse8 .cse15 .cse12 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse14 (not (= ~token~0 (+ 2 ~local~0))) .cse4 .cse5 .cse7 .cse8 .cse15 .cse12 .cse16 .cse17) (or .cse0 .cse1 .cse14 .cse5 .cse6 .cse21 .cse7 .cse8 .cse15 .cse12 .cse16 .cse17 (not (= (+ ~local~0 1) ~token~0))) (or .cse0 .cse18 .cse20 .cse1 .cse2 .cse22 .cse7 .cse8 .cse9 .cse15 .cse12 .cse16 .cse17) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse23 .cse8 .cse15 .cse11 .cse12 .cse16 .cse17) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse15 .cse10 .cse11 .cse12 .cse16) (or .cse0 .cse18 .cse1 .cse2 .cse5 .cse22 .cse7 .cse8 .cse9 .cse15 .cse12 .cse16 .cse17) (or .cse0 .cse18 .cse19 .cse20 .cse1 .cse2 .cse3 (and .cse24 .cse25 .cse26) .cse6 .cse7 .cse8 .cse10 .cse12) (or .cse0 .cse1 .cse2 .cse14 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse12 .cse17 .cse13)))) [2023-12-19 01:41:58,087 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 262 276) no Hoare annotation was computed. [2023-12-19 01:41:58,087 INFO L899 garLoopResultBuilder]: For program point L49-1(lines 49 53) no Hoare annotation was computed. [2023-12-19 01:41:58,087 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 48) no Hoare annotation was computed. [2023-12-19 01:41:58,087 INFO L899 garLoopResultBuilder]: For program point L44-2(lines 43 58) no Hoare annotation was computed. [2023-12-19 01:41:58,088 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 262 276) the Hoare annotation is: (let ((.cse1 (not (= ~p_dw_pc~0 0))) (.cse0 (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)|)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 1))) (or .cse0 .cse1 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (or .cse0 (= ~c_dr_pc~0 2) (< ~p_dw_pc~0 1)))) [2023-12-19 01:41:58,088 INFO L899 garLoopResultBuilder]: For program point L266-1(lines 262 276) no Hoare annotation was computed. [2023-12-19 01:41:58,088 INFO L899 garLoopResultBuilder]: For program point L783(lines 783 792) no Hoare annotation was computed. [2023-12-19 01:41:58,088 INFO L899 garLoopResultBuilder]: For program point L783-2(lines 783 792) no Hoare annotation was computed. [2023-12-19 01:41:58,088 INFO L899 garLoopResultBuilder]: For program point L746(lines 746 751) no Hoare annotation was computed. [2023-12-19 01:41:58,088 INFO L899 garLoopResultBuilder]: For program point L775(lines 763 777) no Hoare annotation was computed. [2023-12-19 01:41:58,088 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 789) no Hoare annotation was computed. [2023-12-19 01:41:58,088 INFO L899 garLoopResultBuilder]: For program point L764(lines 764 773) no Hoare annotation was computed. [2023-12-19 01:41:58,088 INFO L899 garLoopResultBuilder]: For program point L1020(lines 1020 1024) no Hoare annotation was computed. [2023-12-19 01:41:58,088 INFO L899 garLoopResultBuilder]: For program point L764-2(lines 764 773) no Hoare annotation was computed. [2023-12-19 01:41:58,088 INFO L899 garLoopResultBuilder]: For program point L1020-2(lines 995 1028) no Hoare annotation was computed. [2023-12-19 01:41:58,088 INFO L899 garLoopResultBuilder]: For program point L756(lines 744 758) no Hoare annotation was computed. [2023-12-19 01:41:58,088 INFO L899 garLoopResultBuilder]: For program point L1012(lines 1012 1016) no Hoare annotation was computed. [2023-12-19 01:41:58,088 INFO L899 garLoopResultBuilder]: For program point L1012-2(lines 1012 1016) no Hoare annotation was computed. [2023-12-19 01:41:58,088 INFO L899 garLoopResultBuilder]: For program point L1004(lines 1004 1008) no Hoare annotation was computed. [2023-12-19 01:41:58,088 INFO L899 garLoopResultBuilder]: For program point L1004-2(lines 1004 1008) no Hoare annotation was computed. [2023-12-19 01:41:58,089 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 995 1028) the Hoare annotation is: (let ((.cse27 (= |old(~t2_st~0)| ~t2_st~0)) (.cse30 (= ~t1_st~0 0)) (.cse26 (= |old(~t1_st~0)| ~t1_st~0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse31 (= 0 ~t2_st~0))) (let ((.cse25 (not (= (+ ~local~0 1) ~token~0))) (.cse23 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0)))) (.cse11 (and .cse26 .cse29 .cse31)) (.cse24 (not (= ~token~0 (+ 2 ~local~0)))) (.cse17 (and .cse29 .cse27 .cse30)) (.cse9 (= ~m_pc~0 1)) (.cse22 (not (= ~m_pc~0 ~t1_pc~0))) (.cse14 (not (= |old(~t1_st~0)| 0))) (.cse15 (< 0 ~t1_pc~0)) (.cse3 (not (= |old(~t2_st~0)| 0))) (.cse28 (and .cse29 .cse30 .cse31)) (.cse18 (< |old(~m_st~0)| 2)) (.cse10 (< 0 ~t2_pc~0)) (.cse19 (< ~E_1~0 2)) (.cse0 (< ~T1_E~0 2)) (.cse1 (not (= ~t2_i~0 1))) (.cse2 (< ~E_2~0 2)) (.cse21 (and .cse26 .cse29 .cse27)) (.cse4 (< |old(~t1_st~0)| 2)) (.cse5 (not (= ~t1_pc~0 1))) (.cse6 (< ~E_M~0 2)) (.cse16 (< |old(~t2_st~0)| 2)) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse12 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse20 (not (= ~t2_pc~0 1))) (.cse13 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse14 .cse15 .cse1 .cse2 .cse6 .cse16 .cse17 .cse7 .cse8 .cse18 .cse12 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse21 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse12 .cse19 .cse20) (or .cse0 .cse14 .cse22 .cse15 .cse1 .cse2 .cse6 .cse16 .cse17 .cse7 .cse8 .cse12 .cse20) (or .cse0 .cse1 .cse21 .cse5 .cse6 .cse16 .cse7 .cse23 .cse8 .cse18 .cse12 .cse19 .cse20) (or .cse0 .cse14 .cse1 .cse2 .cse5 .cse6 .cse16 .cse17 .cse7 .cse8 .cse18 .cse12 .cse19 .cse20 .cse13) (or .cse0 .cse1 .cse2 .cse21 .cse24 .cse4 .cse5 .cse7 .cse8 .cse18 .cse12 .cse19 .cse20) (or .cse0 .cse1 .cse21 .cse5 .cse6 .cse16 .cse7 .cse8 .cse18 .cse12 .cse19 .cse20 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse11 .cse12 .cse19 .cse20 .cse25) (or .cse0 .cse14 .cse15 .cse1 .cse2 .cse17 .cse7 .cse8 .cse9 .cse18 .cse12 .cse19 .cse20) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse23 .cse8 .cse18 .cse11 .cse12 .cse19 .cse20) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse18 .cse10 .cse11 .cse12 .cse19) (or .cse0 .cse1 (and .cse26 (= ~m_st~0 0) .cse27) .cse2 .cse24 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse12 (not (= |old(~m_st~0)| 0)) .cse19 .cse20) (or .cse0 .cse14 .cse1 .cse2 .cse5 .cse17 .cse7 .cse8 .cse9 .cse18 .cse12 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse18 .cse12 .cse19 .cse20) (or .cse0 .cse14 .cse22 .cse15 .cse1 .cse2 .cse3 .cse28 .cse6 .cse7 .cse8 .cse10 .cse12) (or .cse0 .cse14 .cse15 .cse1 .cse2 .cse3 .cse28 .cse6 .cse7 .cse8 .cse18 .cse10 .cse12 .cse19) (or .cse0 .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse12 .cse20 .cse13)))) [2023-12-19 01:41:58,089 INFO L899 garLoopResultBuilder]: For program point L765(lines 765 770) no Hoare annotation was computed. [2023-12-19 01:41:58,089 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 995 1028) no Hoare annotation was computed. [2023-12-19 01:41:58,089 INFO L899 garLoopResultBuilder]: For program point L794(lines 782 796) no Hoare annotation was computed. [2023-12-19 01:41:58,089 INFO L899 garLoopResultBuilder]: For program point L745(lines 745 754) no Hoare annotation was computed. [2023-12-19 01:41:58,089 INFO L899 garLoopResultBuilder]: For program point L745-2(lines 745 754) no Hoare annotation was computed. [2023-12-19 01:41:58,089 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 387 411) no Hoare annotation was computed. [2023-12-19 01:41:58,089 INFO L899 garLoopResultBuilder]: For program point L403(lines 403 407) no Hoare annotation was computed. [2023-12-19 01:41:58,089 INFO L899 garLoopResultBuilder]: For program point L401(line 401) no Hoare annotation was computed. [2023-12-19 01:41:58,090 INFO L899 garLoopResultBuilder]: For program point L403-2(lines 387 411) no Hoare annotation was computed. [2023-12-19 01:41:58,090 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2023-12-19 01:41:58,090 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 387 411) the Hoare annotation is: (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse1 (not (= ~p_dw_pc~0 0)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (or (= ~c_dr_pc~0 2) .cse0 (< ~p_dw_pc~0 1)) (or .cse0 .cse1 (not (= ~c_dr_pc~0 1))))) [2023-12-19 01:41:58,090 INFO L895 garLoopResultBuilder]: At program point L393(line 393) the Hoare annotation is: (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse1 (not (= ~p_dw_pc~0 0)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (or (= ~c_dr_pc~0 2) .cse0 (< ~p_dw_pc~0 1)) (or .cse0 .cse1 (not (= ~c_dr_pc~0 1))))) [2023-12-19 01:41:58,090 INFO L895 garLoopResultBuilder]: At program point L395-2(lines 395 399) the Hoare annotation is: (let ((.cse0 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse1 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse2 (not (= ~p_dw_pc~0 0))) (.cse3 (and .cse0 (= activate_threads1_~tmp~1 0) .cse1))) (and (or (= ~c_dr_pc~0 2) (and .cse0 .cse1) (= ~p_dw_pc~0 1) (< ~p_dw_pc~0 1) (not (= ~q_read_ev~0 2))) (or .cse2 (not (= ~c_dr_pc~0 1)) .cse3) (or .cse2 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse3)))) [2023-12-19 01:41:58,090 INFO L899 garLoopResultBuilder]: For program point L393-1(line 393) no Hoare annotation was computed. [2023-12-19 01:41:58,090 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 798 805) no Hoare annotation was computed. [2023-12-19 01:41:58,090 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 798 805) the Hoare annotation is: true [2023-12-19 01:41:58,090 INFO L899 garLoopResultBuilder]: For program point L923-1(lines 922 955) no Hoare annotation was computed. [2023-12-19 01:41:58,090 INFO L899 garLoopResultBuilder]: For program point L948-1(lines 919 956) no Hoare annotation was computed. [2023-12-19 01:41:58,091 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 919 956) the Hoare annotation is: (let ((.cse11 (< ~t2_st~0 2)) (.cse17 (= ~m_pc~0 1)) (.cse21 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0)))) (.cse22 (not (= ~m_pc~0 ~t1_pc~0))) (.cse16 (not (= ~m_st~0 0))) (.cse19 (not (= ~token~0 ~local~0))) (.cse0 (< 0 ~t1_pc~0)) (.cse20 (< 0 ~t2_pc~0)) (.cse9 (not (= ~t1_st~0 0))) (.cse14 (< ~t1_st~0 2)) (.cse1 (not (= ~t2_i~0 1))) (.cse2 (< ~m_st~0 2)) (.cse15 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse5 (< |old(~E_1~0)| 2)) (.cse6 (< |old(~E_M~0)| 2)) (.cse18 (not (= 0 ~t2_st~0))) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse8 (< |old(~E_2~0)| 2)) (.cse10 (not (= ~t2_pc~0 1))) (.cse12 (< |old(~T1_E~0)| 2)) (.cse13 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse1 (not (= ~token~0 (+ 2 ~local~0))) .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13) (or .cse1 .cse2 .cse15 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13) (or .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19) (or .cse14 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse1 .cse15 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse19) (or .cse14 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse8 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13) (or .cse1 .cse2 .cse15 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse1 .cse15 .cse3 .cse21 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse16 .cse8 .cse12 .cse13 .cse19) (or .cse22 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19) (or .cse14 .cse1 .cse2 .cse15 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse7 .cse8 .cse10 .cse12 .cse13) (or .cse1 .cse2 .cse15 .cse3 .cse21 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse8 .cse9 .cse12 .cse13) (or .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse8 .cse9 .cse12 .cse13 .cse19) (or .cse22 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse16 .cse8 .cse9 .cse12 .cse13 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse8 .cse9 .cse12 .cse13) (or .cse14 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse10 (not (= (+ ~local~0 1) ~token~0)) .cse12 .cse13))) [2023-12-19 01:41:58,091 INFO L899 garLoopResultBuilder]: For program point L938-1(lines 922 955) no Hoare annotation was computed. [2023-12-19 01:41:58,091 INFO L899 garLoopResultBuilder]: For program point L928-1(lines 922 955) no Hoare annotation was computed. [2023-12-19 01:41:58,091 INFO L899 garLoopResultBuilder]: For program point L943-1(lines 922 955) no Hoare annotation was computed. [2023-12-19 01:41:58,091 INFO L899 garLoopResultBuilder]: For program point L933-1(lines 922 955) no Hoare annotation was computed. [2023-12-19 01:41:58,091 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 919 956) no Hoare annotation was computed. [2023-12-19 01:41:58,091 INFO L899 garLoopResultBuilder]: For program point L319-1(lines 318 331) no Hoare annotation was computed. [2023-12-19 01:41:58,091 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 315 332) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_pc~0 0))) (.cse1 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (or (= ~c_dr_pc~0 2) .cse1 (< ~p_dw_pc~0 1)) (or .cse0 .cse1 (not (= ~c_dr_pc~0 1))))) [2023-12-19 01:41:58,091 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 315 332) no Hoare annotation was computed. [2023-12-19 01:41:58,091 INFO L899 garLoopResultBuilder]: For program point L324-1(lines 315 332) no Hoare annotation was computed. [2023-12-19 01:41:58,091 INFO L899 garLoopResultBuilder]: For program point L124(lines 102 126) no Hoare annotation was computed. [2023-12-19 01:41:58,091 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2023-12-19 01:41:58,092 INFO L899 garLoopResultBuilder]: For program point L113-1(lines 113 122) no Hoare annotation was computed. [2023-12-19 01:41:58,092 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 99 127) the Hoare annotation is: true [2023-12-19 01:41:58,092 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 109) no Hoare annotation was computed. [2023-12-19 01:41:58,095 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 99 127) no Hoare annotation was computed. [2023-12-19 01:41:58,096 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 112) no Hoare annotation was computed. [2023-12-19 01:41:58,096 INFO L899 garLoopResultBuilder]: For program point L103-2(lines 102 126) no Hoare annotation was computed. [2023-12-19 01:41:58,096 INFO L895 garLoopResultBuilder]: At program point L861(line 861) the Hoare annotation is: (let ((.cse7 (not (= ~m_pc~0 1))) (.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0)) (.cse12 (= 0 ~t2_st~0)) (.cse14 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse10 .cse11 .cse20))) [2023-12-19 01:41:58,096 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2023-12-19 01:41:58,096 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 439) no Hoare annotation was computed. [2023-12-19 01:41:58,096 INFO L895 garLoopResultBuilder]: At program point L730(line 730) the Hoare annotation is: (let ((.cse12 (= ~t1_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~t1_i~0 1)) (.cse11 (not (= ~m_pc~0 1))) (.cse5 (<= 2 ~m_st~0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse8 (= ~t2_pc~0 1)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~token~0 (+ 2 ~local~0)) .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse7 .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse4 .cse11 .cse5 (<= ~t1_pc~0 0) .cse6 .cse12 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2023-12-19 01:41:58,096 INFO L899 garLoopResultBuilder]: For program point L730-1(line 730) no Hoare annotation was computed. [2023-12-19 01:41:58,096 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 153 201) no Hoare annotation was computed. [2023-12-19 01:41:58,096 INFO L895 garLoopResultBuilder]: At program point L499-1(lines 499 536) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (= ~c_dr_pc~0 0)) (and .cse0 (= ~c_dr_pc~0 1)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-12-19 01:41:58,096 INFO L895 garLoopResultBuilder]: At program point L1127(line 1127) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (<= ~t1_pc~0 0)) (.cse5 (= ~t1_st~0 0)) (.cse6 (= ~E_2~0 2)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0)) (.cse9 (= ~E_M~0 2)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~M_E~0 2)) (.cse13 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~token~0 ~local~0) .cse11 .cse12 .cse13))) [2023-12-19 01:41:58,097 INFO L895 garLoopResultBuilder]: At program point L1127-1(line 1127) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (<= ~t1_pc~0 0)) (.cse5 (= ~t1_st~0 0)) (.cse6 (= ~E_2~0 2)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0)) (.cse9 (= ~E_M~0 2)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~M_E~0 2)) (.cse13 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~token~0 ~local~0) .cse11 .cse12 .cse13))) [2023-12-19 01:41:58,097 INFO L899 garLoopResultBuilder]: For program point L863(line 863) no Hoare annotation was computed. [2023-12-19 01:41:58,097 INFO L899 garLoopResultBuilder]: For program point L632(lines 632 636) no Hoare annotation was computed. [2023-12-19 01:41:58,097 INFO L899 garLoopResultBuilder]: For program point L599(line 599) no Hoare annotation was computed. [2023-12-19 01:41:58,097 INFO L895 garLoopResultBuilder]: At program point L1128(line 1128) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (<= ~t1_pc~0 0)) (.cse5 (= ~t1_st~0 0)) (.cse6 (= ~E_2~0 2)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0)) (.cse9 (= ~E_M~0 2)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~M_E~0 2)) (.cse13 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~token~0 ~local~0) .cse11 .cse12 .cse13))) [2023-12-19 01:41:58,097 INFO L899 garLoopResultBuilder]: For program point L1063-1(lines 1052 1085) no Hoare annotation was computed. [2023-12-19 01:41:58,097 INFO L899 garLoopResultBuilder]: For program point transmit1_returnLabel#1(lines 669 704) no Hoare annotation was computed. [2023-12-19 01:41:58,097 INFO L899 garLoopResultBuilder]: For program point L865(lines 865 869) no Hoare annotation was computed. [2023-12-19 01:41:58,097 INFO L895 garLoopResultBuilder]: At program point L898-1(lines 860 912) the Hoare annotation is: (let ((.cse7 (not (= ~m_pc~0 1))) (.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0)) (.cse12 (= 0 ~t2_st~0)) (.cse14 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse10 .cse11 .cse20))) [2023-12-19 01:41:58,097 INFO L899 garLoopResultBuilder]: For program point L865-1(lines 860 912) no Hoare annotation was computed. [2023-12-19 01:41:58,097 INFO L895 garLoopResultBuilder]: At program point L172-1(lines 172 195) the Hoare annotation is: (and (not (= ~c_dr_pc~0 2)) (or (= ~p_dw_pc~0 0) (< 0 ~p_dw_pc~0))) [2023-12-19 01:41:58,097 INFO L899 garLoopResultBuilder]: For program point start_simulation2_returnLabel#1(lines 1117 1175) no Hoare annotation was computed. [2023-12-19 01:41:58,097 INFO L899 garLoopResultBuilder]: For program point L1164(lines 1164 1168) no Hoare annotation was computed. [2023-12-19 01:41:58,097 INFO L899 garLoopResultBuilder]: For program point master_returnLabel#1(lines 625 668) no Hoare annotation was computed. [2023-12-19 01:41:58,098 INFO L895 garLoopResultBuilder]: At program point L471(line 471) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (= ~c_dr_pc~0 0)) (and .cse0 (= ~c_dr_pc~0 1)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-12-19 01:41:58,098 INFO L899 garLoopResultBuilder]: For program point L471-1(line 471) no Hoare annotation was computed. [2023-12-19 01:41:58,098 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2023-12-19 01:41:58,098 INFO L895 garLoopResultBuilder]: At program point L1132-1(lines 1132 1169) the Hoare annotation is: (let ((.cse7 (not (= ~m_pc~0 1))) (.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0)) (.cse12 (= 0 ~t2_st~0)) (.cse14 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse10 .cse11 .cse20))) [2023-12-19 01:41:58,098 INFO L899 garLoopResultBuilder]: For program point L901(lines 901 908) no Hoare annotation was computed. [2023-12-19 01:41:58,098 INFO L899 garLoopResultBuilder]: For program point L901-2(lines 901 908) no Hoare annotation was computed. [2023-12-19 01:41:58,098 INFO L899 garLoopResultBuilder]: For program point start_simulation1_returnLabel#1(lines 484 542) no Hoare annotation was computed. [2023-12-19 01:41:58,098 INFO L899 garLoopResultBuilder]: For program point L373(lines 373 377) no Hoare annotation was computed. [2023-12-19 01:41:58,098 INFO L899 garLoopResultBuilder]: For program point L373-2(lines 372 385) no Hoare annotation was computed. [2023-12-19 01:41:58,098 INFO L899 garLoopResultBuilder]: For program point L473(lines 473 478) no Hoare annotation was computed. [2023-12-19 01:41:58,098 INFO L899 garLoopResultBuilder]: For program point L242(lines 242 254) no Hoare annotation was computed. [2023-12-19 01:41:58,098 INFO L899 garLoopResultBuilder]: For program point L1068-1(lines 1052 1085) no Hoare annotation was computed. [2023-12-19 01:41:58,098 INFO L899 garLoopResultBuilder]: For program point L870-1(lines 860 912) no Hoare annotation was computed. [2023-12-19 01:41:58,098 INFO L899 garLoopResultBuilder]: For program point eval2_returnLabel#1(lines 854 918) no Hoare annotation was computed. [2023-12-19 01:41:58,098 INFO L895 garLoopResultBuilder]: At program point L507(line 507) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (= ~c_dr_pc~0 0)) (and .cse0 (= ~c_dr_pc~0 1)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-12-19 01:41:58,099 INFO L899 garLoopResultBuilder]: For program point L507-1(line 507) no Hoare annotation was computed. [2023-12-19 01:41:58,099 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2023-12-19 01:41:58,099 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 214) no Hoare annotation was computed. [2023-12-19 01:41:58,099 INFO L899 garLoopResultBuilder]: For program point L673(lines 673 681) no Hoare annotation was computed. [2023-12-19 01:41:58,099 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 203 261) no Hoare annotation was computed. [2023-12-19 01:41:58,099 INFO L899 garLoopResultBuilder]: For program point transmit2_returnLabel#1(lines 705 740) no Hoare annotation was computed. [2023-12-19 01:41:58,099 INFO L895 garLoopResultBuilder]: At program point L443(lines 418 458) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (= ~c_dr_pc~0 0)) (and .cse0 (= ~c_dr_pc~0 1)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-12-19 01:41:58,099 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 187) no Hoare annotation was computed. [2023-12-19 01:41:58,099 INFO L895 garLoopResultBuilder]: At program point L1104(line 1104) the Hoare annotation is: (let ((.cse7 (not (= ~m_pc~0 1))) (.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0)) (.cse12 (= 0 ~t2_st~0)) (.cse14 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse10 .cse11 .cse20))) [2023-12-19 01:41:58,099 INFO L899 garLoopResultBuilder]: For program point L1104-1(line 1104) no Hoare annotation was computed. [2023-12-19 01:41:58,099 INFO L899 garLoopResultBuilder]: For program point L873(lines 873 880) no Hoare annotation was computed. [2023-12-19 01:41:58,099 INFO L899 garLoopResultBuilder]: For program point L873-2(lines 873 880) no Hoare annotation was computed. [2023-12-19 01:41:58,099 INFO L899 garLoopResultBuilder]: For program point eval1_returnLabel#1(lines 412 464) no Hoare annotation was computed. [2023-12-19 01:41:58,099 INFO L899 garLoopResultBuilder]: For program point L378-1(lines 369 386) no Hoare annotation was computed. [2023-12-19 01:41:58,099 INFO L899 garLoopResultBuilder]: For program point L709(lines 709 717) no Hoare annotation was computed. [2023-12-19 01:41:58,100 INFO L899 garLoopResultBuilder]: For program point L676(lines 676 680) no Hoare annotation was computed. [2023-12-19 01:41:58,100 INFO L895 garLoopResultBuilder]: At program point L511(line 511) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (= ~c_dr_pc~0 0)) (and .cse0 (= ~c_dr_pc~0 1)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-12-19 01:41:58,100 INFO L895 garLoopResultBuilder]: At program point L511-1(line 511) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (= ~c_dr_pc~0 0)) (and .cse0 (= ~c_dr_pc~0 1)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-12-19 01:41:58,100 INFO L895 garLoopResultBuilder]: At program point L247(line 247) the Hoare annotation is: false [2023-12-19 01:41:58,100 INFO L899 garLoopResultBuilder]: For program point L1106(lines 1106 1111) no Hoare annotation was computed. [2023-12-19 01:41:58,100 INFO L899 garLoopResultBuilder]: For program point L1073-1(lines 1052 1085) no Hoare annotation was computed. [2023-12-19 01:41:58,100 INFO L895 garLoopResultBuilder]: At program point L512(line 512) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (= ~c_dr_pc~0 0)) (and .cse0 (= ~c_dr_pc~0 1)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-12-19 01:41:58,100 INFO L899 garLoopResultBuilder]: For program point L281(lines 281 285) no Hoare annotation was computed. [2023-12-19 01:41:58,100 INFO L899 garLoopResultBuilder]: For program point L281-2(lines 280 293) no Hoare annotation was computed. [2023-12-19 01:41:58,100 INFO L895 garLoopResultBuilder]: At program point L1140(line 1140) the Hoare annotation is: (let ((.cse7 (not (= ~m_pc~0 1))) (.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0)) (.cse12 (= 0 ~t2_st~0)) (.cse14 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse10 .cse11 .cse20))) [2023-12-19 01:41:58,100 INFO L899 garLoopResultBuilder]: For program point L1140-1(line 1140) no Hoare annotation was computed. [2023-12-19 01:41:58,100 INFO L899 garLoopResultBuilder]: For program point L810(lines 810 814) no Hoare annotation was computed. [2023-12-19 01:41:58,100 INFO L899 garLoopResultBuilder]: For program point L810-2(lines 809 827) no Hoare annotation was computed. [2023-12-19 01:41:58,100 INFO L895 garLoopResultBuilder]: At program point L513(line 513) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (= ~c_dr_pc~0 0)) (and .cse0 (= ~c_dr_pc~0 1)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-12-19 01:41:58,101 INFO L899 garLoopResultBuilder]: For program point L480(lines 469 482) no Hoare annotation was computed. [2023-12-19 01:41:58,101 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 454) no Hoare annotation was computed. [2023-12-19 01:41:58,101 INFO L899 garLoopResultBuilder]: For program point L712(lines 712 716) no Hoare annotation was computed. [2023-12-19 01:41:58,101 INFO L895 garLoopResultBuilder]: At program point L646(line 646) the Hoare annotation is: (let ((.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= ~t1_pc~0 0)) (.cse6 (= ~t1_st~0 0)) (.cse12 (= ~t2_pc~0 1)) (.cse13 (<= 2 ~t2_st~0)) (.cse14 (= ~t1_pc~0 1)) (.cse15 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~t1_i~0 1)) (.cse3 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= 0 ~t2_st~0)) (.cse16 (= ~token~0 ~local~0)) (.cse11 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse12 .cse8 .cse9 .cse13) (and .cse14 .cse15 .cse0 .cse1 .cse3 .cse5 .cse7 .cse12 .cse8 .cse9 .cse16 .cse13) (and .cse14 .cse15 .cse0 .cse1 .cse3 (not (= ~m_pc~0 1)) .cse5 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11))) [2023-12-19 01:41:58,101 INFO L899 garLoopResultBuilder]: For program point L646-1(line 646) no Hoare annotation was computed. [2023-12-19 01:41:58,101 INFO L899 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2023-12-19 01:41:58,101 INFO L895 garLoopResultBuilder]: At program point L252(line 252) the Hoare annotation is: false [2023-12-19 01:41:58,101 INFO L895 garLoopResultBuilder]: At program point L252-1(lines 218 255) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (< 0 ~p_dw_pc~0) (and .cse0 (= ~c_dr_pc~0 0)) (and .cse0 (= ~c_dr_pc~0 1)))) [2023-12-19 01:41:58,101 INFO L895 garLoopResultBuilder]: At program point L1144(line 1144) the Hoare annotation is: (let ((.cse7 (not (= ~m_pc~0 1))) (.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0)) (.cse12 (= 0 ~t2_st~0)) (.cse14 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse10 .cse11 .cse20))) [2023-12-19 01:41:58,101 INFO L895 garLoopResultBuilder]: At program point L1144-1(line 1144) the Hoare annotation is: (let ((.cse7 (not (= ~m_pc~0 1))) (.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0)) (.cse12 (= 0 ~t2_st~0)) (.cse14 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse10 .cse11 .cse20))) [2023-12-19 01:41:58,101 INFO L899 garLoopResultBuilder]: For program point L1078-1(lines 1049 1086) no Hoare annotation was computed. [2023-12-19 01:41:58,101 INFO L899 garLoopResultBuilder]: For program point L286-1(lines 277 294) no Hoare annotation was computed. [2023-12-19 01:41:58,102 INFO L895 garLoopResultBuilder]: At program point L1145(line 1145) the Hoare annotation is: (let ((.cse7 (not (= ~m_pc~0 1))) (.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0)) (.cse12 (= 0 ~t2_st~0)) (.cse14 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse10 .cse11 .cse20))) [2023-12-19 01:41:58,102 INFO L899 garLoopResultBuilder]: For program point L815-1(lines 809 827) no Hoare annotation was computed. [2023-12-19 01:41:58,102 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 527) no Hoare annotation was computed. [2023-12-19 01:41:58,102 INFO L899 garLoopResultBuilder]: For program point L518-2(lines 518 527) no Hoare annotation was computed. [2023-12-19 01:41:58,102 INFO L895 garLoopResultBuilder]: At program point L419(line 419) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (= ~c_dr_pc~0 0)) (and .cse0 (= ~c_dr_pc~0 1)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-12-19 01:41:58,102 INFO L895 garLoopResultBuilder]: At program point L1146(line 1146) the Hoare annotation is: (let ((.cse7 (not (= ~m_pc~0 1))) (.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0)) (.cse12 (= 0 ~t2_st~0)) (.cse14 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse10 .cse11 .cse20))) [2023-12-19 01:41:58,102 INFO L899 garLoopResultBuilder]: For program point L1113(lines 1102 1115) no Hoare annotation was computed. [2023-12-19 01:41:58,102 INFO L895 garLoopResultBuilder]: At program point L684-1(lines 684 697) the Hoare annotation is: (let ((.cse4 (= ~m_st~0 0)) (.cse11 (= ~token~0 ~local~0)) (.cse15 (<= ~t2_pc~0 0)) (.cse5 (not (= ~m_pc~0 1))) (.cse14 (= 0 ~t2_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (<= 2 ~E_M~0)) (.cse13 (<= 2 ~m_st~0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse8 (= ~t2_pc~0 1)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse6 .cse7 .cse9 .cse10 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse13 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14) (and .cse0 .cse1 .cse2 (= (+ ~local~0 1) ~token~0) .cse3 .cse13 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12))) [2023-12-19 01:41:58,102 INFO L899 garLoopResultBuilder]: For program point L421(line 421) no Hoare annotation was computed. [2023-12-19 01:41:58,102 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-19 01:41:58,102 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 169) no Hoare annotation was computed. [2023-12-19 01:41:58,102 INFO L899 garLoopResultBuilder]: For program point L884-1(lines 860 912) no Hoare annotation was computed. [2023-12-19 01:41:58,103 INFO L899 garLoopResultBuilder]: For program point L1149(line 1149) no Hoare annotation was computed. [2023-12-19 01:41:58,103 INFO L895 garLoopResultBuilder]: At program point L720-1(lines 720 733) the Hoare annotation is: (let ((.cse13 (<= ~t1_pc~0 0)) (.cse11 (= ~token~0 ~local~0)) (.cse15 (not (= ~m_pc~0 1))) (.cse5 (<= 2 ~m_st~0)) (.cse7 (= ~t1_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse12 (<= 2 ~t1_st~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse14 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse8 (<= 2 ~E_2~0)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse6 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse14 .cse13 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6 .cse8 (= ~token~0 (+ 2 ~local~0)) .cse9 .cse10))) [2023-12-19 01:41:58,103 INFO L895 garLoopResultBuilder]: At program point L654-1(lines 640 661) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse7 (= ~t1_st~0 0)) (.cse15 (= ~t2_pc~0 1)) (.cse16 (<= 2 ~t2_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse17 (not (= ~m_pc~0 1))) (.cse6 (<= 2 ~T1_E~0)) (.cse8 (<= 2 ~E_2~0)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= 0 ~t2_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse12 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse0 .cse1 .cse2 .cse4 .cse6 .cse8 .cse15 (= ~token~0 (+ 2 ~local~0)) .cse9 .cse10 .cse16) (and .cse13 .cse14 .cse0 .cse1 .cse2 .cse4 .cse17 .cse6 .cse8 .cse15 .cse9 .cse10 .cse18 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse16) (and .cse13 .cse14 .cse0 .cse1 .cse2 .cse4 .cse17 .cse6 .cse8 .cse9 .cse10 .cse11 .cse18 .cse12))) [2023-12-19 01:41:58,103 INFO L895 garLoopResultBuilder]: At program point L522(line 522) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (= ~c_dr_pc~0 0)) (and .cse0 (= ~c_dr_pc~0 1)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-12-19 01:41:58,103 INFO L899 garLoopResultBuilder]: For program point L522-1(line 522) no Hoare annotation was computed. [2023-12-19 01:41:58,103 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2023-12-19 01:41:58,103 INFO L899 garLoopResultBuilder]: For program point L423-1(lines 418 458) no Hoare annotation was computed. [2023-12-19 01:41:58,103 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 364) no Hoare annotation was computed. [2023-12-19 01:41:58,103 INFO L899 garLoopResultBuilder]: For program point L357-2(lines 353 368) no Hoare annotation was computed. [2023-12-19 01:41:58,103 INFO L899 garLoopResultBuilder]: For program point L820-1(lines 806 828) no Hoare annotation was computed. [2023-12-19 01:41:58,103 INFO L899 garLoopResultBuilder]: For program point $Ultimate##38(lines 179 187) no Hoare annotation was computed. [2023-12-19 01:41:58,103 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 168) no Hoare annotation was computed. [2023-12-19 01:41:58,103 INFO L899 garLoopResultBuilder]: For program point L1151(lines 1151 1160) no Hoare annotation was computed. [2023-12-19 01:41:58,103 INFO L899 garLoopResultBuilder]: For program point L1151-2(lines 1151 1160) no Hoare annotation was computed. [2023-12-19 01:41:58,103 INFO L899 garLoopResultBuilder]: For program point L887(lines 887 894) no Hoare annotation was computed. [2023-12-19 01:41:58,103 INFO L899 garLoopResultBuilder]: For program point L887-2(lines 887 894) no Hoare annotation was computed. [2023-12-19 01:41:58,103 INFO L899 garLoopResultBuilder]: For program point L1053(lines 1053 1057) no Hoare annotation was computed. [2023-12-19 01:41:58,104 INFO L899 garLoopResultBuilder]: For program point L1053-2(lines 1052 1085) no Hoare annotation was computed. [2023-12-19 01:41:58,104 INFO L895 garLoopResultBuilder]: At program point L492(line 492) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0)) [2023-12-19 01:41:58,104 INFO L899 garLoopResultBuilder]: For program point L492-1(line 492) no Hoare annotation was computed. [2023-12-19 01:41:58,104 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-19 01:41:58,104 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2023-12-19 01:41:58,104 INFO L895 garLoopResultBuilder]: At program point L494(line 494) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_pc~0 0)) [2023-12-19 01:41:58,104 INFO L895 garLoopResultBuilder]: At program point L494-1(line 494) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_pc~0 0)) [2023-12-19 01:41:58,104 INFO L899 garLoopResultBuilder]: For program point L428(lines 418 458) no Hoare annotation was computed. [2023-12-19 01:41:58,104 INFO L899 garLoopResultBuilder]: For program point L1188(lines 1188 1194) no Hoare annotation was computed. [2023-12-19 01:41:58,104 INFO L895 garLoopResultBuilder]: At program point L1155(line 1155) the Hoare annotation is: (let ((.cse7 (not (= ~m_pc~0 1))) (.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0)) (.cse12 (= 0 ~t2_st~0)) (.cse14 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse10 .cse11 .cse20))) [2023-12-19 01:41:58,104 INFO L899 garLoopResultBuilder]: For program point L1155-1(line 1155) no Hoare annotation was computed. [2023-12-19 01:41:58,104 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2023-12-19 01:41:58,104 INFO L895 garLoopResultBuilder]: At program point L495(line 495) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_pc~0 0)) [2023-12-19 01:41:58,105 INFO L895 garLoopResultBuilder]: At program point L694(line 694) the Hoare annotation is: (let ((.cse10 (<= 2 ~t2_st~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse7 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (<= 2 ~T1_E~0)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse12 (= 0 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= (+ ~local~0 1) ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse12 (<= ~t2_pc~0 0)))) [2023-12-19 01:41:58,105 INFO L899 garLoopResultBuilder]: For program point L694-1(line 694) no Hoare annotation was computed. [2023-12-19 01:41:58,105 INFO L899 garLoopResultBuilder]: For program point L1190(lines 1190 1193) no Hoare annotation was computed. [2023-12-19 01:41:58,105 INFO L899 garLoopResultBuilder]: For program point L1058-1(lines 1052 1085) no Hoare annotation was computed. [2023-12-19 01:41:58,105 INFO L899 garLoopResultBuilder]: For program point $Ultimate##118(lines 654 660) no Hoare annotation was computed. [2023-12-19 01:41:58,105 INFO L899 garLoopResultBuilder]: For program point L629(lines 629 637) no Hoare annotation was computed. [2023-12-19 01:41:58,105 INFO L895 garLoopResultBuilder]: At program point L1125(line 1125) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (<= ~t1_pc~0 0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~E_M~0 2) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (= ~M_E~0 2) (<= ~t2_pc~0 0)) [2023-12-19 01:41:58,105 INFO L899 garLoopResultBuilder]: For program point L1125-1(line 1125) no Hoare annotation was computed. [2023-12-19 01:41:58,105 INFO L899 garLoopResultBuilder]: For program point L95(lines 73 97) no Hoare annotation was computed. [2023-12-19 01:41:58,105 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2023-12-19 01:41:58,105 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 84 93) no Hoare annotation was computed. [2023-12-19 01:41:58,105 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 70 98) no Hoare annotation was computed. [2023-12-19 01:41:58,105 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 80) no Hoare annotation was computed. [2023-12-19 01:41:58,105 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2023-12-19 01:41:58,105 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 70 98) the Hoare annotation is: true [2023-12-19 01:41:58,105 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 73 97) no Hoare annotation was computed. [2023-12-19 01:41:58,105 INFO L899 garLoopResultBuilder]: For program point L311(lines 298 313) no Hoare annotation was computed. [2023-12-19 01:41:58,106 INFO L899 garLoopResultBuilder]: For program point L303(lines 303 308) no Hoare annotation was computed. [2023-12-19 01:41:58,106 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 309) no Hoare annotation was computed. [2023-12-19 01:41:58,106 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 295 314) the Hoare annotation is: true [2023-12-19 01:41:58,106 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 295 314) no Hoare annotation was computed. [2023-12-19 01:41:58,106 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 23 30) the Hoare annotation is: true [2023-12-19 01:41:58,106 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2023-12-19 01:41:58,106 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2023-12-19 01:41:58,106 INFO L899 garLoopResultBuilder]: For program point L833(lines 833 848) no Hoare annotation was computed. [2023-12-19 01:41:58,106 INFO L899 garLoopResultBuilder]: For program point L850(lines 832 852) no Hoare annotation was computed. [2023-12-19 01:41:58,106 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 829 853) the Hoare annotation is: true [2023-12-19 01:41:58,106 INFO L899 garLoopResultBuilder]: For program point L841(lines 841 846) no Hoare annotation was computed. [2023-12-19 01:41:58,106 INFO L899 garLoopResultBuilder]: For program point L837(lines 837 847) no Hoare annotation was computed. [2023-12-19 01:41:58,106 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 829 853) no Hoare annotation was computed. [2023-12-19 01:41:58,106 INFO L899 garLoopResultBuilder]: For program point L337-1(lines 336 349) no Hoare annotation was computed. [2023-12-19 01:41:58,106 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 333 350) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_pc~0 0))) (.cse1 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (or (= ~c_dr_pc~0 2) .cse1 (< ~p_dw_pc~0 1)) (or .cse0 .cse1 (not (= ~c_dr_pc~0 1))))) [2023-12-19 01:41:58,106 INFO L899 garLoopResultBuilder]: For program point L342-1(lines 333 350) no Hoare annotation was computed. [2023-12-19 01:41:58,106 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 333 350) no Hoare annotation was computed. [2023-12-19 01:41:58,106 INFO L899 garLoopResultBuilder]: For program point L981-1(lines 960 993) no Hoare annotation was computed. [2023-12-19 01:41:58,107 INFO L899 garLoopResultBuilder]: For program point L971-1(lines 960 993) no Hoare annotation was computed. [2023-12-19 01:41:58,107 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 957 994) the Hoare annotation is: (let ((.cse11 (< ~t2_st~0 2)) (.cse17 (= ~m_pc~0 1)) (.cse21 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0)))) (.cse22 (not (= ~m_pc~0 ~t1_pc~0))) (.cse16 (not (= ~m_st~0 0))) (.cse19 (not (= ~token~0 ~local~0))) (.cse0 (< 0 ~t1_pc~0)) (.cse20 (< 0 ~t2_pc~0)) (.cse9 (not (= ~t1_st~0 0))) (.cse14 (< ~t1_st~0 2)) (.cse1 (not (= ~t2_i~0 1))) (.cse2 (< ~m_st~0 2)) (.cse15 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse5 (< |old(~E_1~0)| 2)) (.cse6 (< |old(~E_M~0)| 2)) (.cse18 (not (= 0 ~t2_st~0))) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse8 (< |old(~E_2~0)| 2)) (.cse10 (not (= ~t2_pc~0 1))) (.cse12 (< |old(~T1_E~0)| 2)) (.cse13 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse1 (not (= ~token~0 (+ 2 ~local~0))) .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13) (or .cse1 .cse2 .cse15 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13) (or .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19) (or .cse14 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse1 .cse15 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse19) (or .cse14 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse8 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13) (or .cse1 .cse2 .cse15 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse1 .cse15 .cse3 .cse21 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse16 .cse8 .cse12 .cse13 .cse19) (or .cse22 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19) (or .cse14 .cse1 .cse2 .cse15 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse7 .cse8 .cse10 .cse12 .cse13) (or .cse1 .cse2 .cse15 .cse3 .cse21 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse8 .cse9 .cse12 .cse13) (or .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse8 .cse9 .cse12 .cse13 .cse19) (or .cse22 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse16 .cse8 .cse9 .cse12 .cse13 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse8 .cse9 .cse12 .cse13) (or .cse14 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse10 (not (= (+ ~local~0 1) ~token~0)) .cse12 .cse13))) [2023-12-19 01:41:58,107 INFO L899 garLoopResultBuilder]: For program point L961-1(lines 960 993) no Hoare annotation was computed. [2023-12-19 01:41:58,107 INFO L899 garLoopResultBuilder]: For program point L986-1(lines 957 994) no Hoare annotation was computed. [2023-12-19 01:41:58,107 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 957 994) no Hoare annotation was computed. [2023-12-19 01:41:58,107 INFO L899 garLoopResultBuilder]: For program point L976-1(lines 960 993) no Hoare annotation was computed. [2023-12-19 01:41:58,107 INFO L899 garLoopResultBuilder]: For program point L966-1(lines 960 993) no Hoare annotation was computed. [2023-12-19 01:41:58,110 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:41:58,111 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 01:41:58,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 01:41:58 BoogieIcfgContainer [2023-12-19 01:41:58,138 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 01:41:58,138 INFO L158 Benchmark]: Toolchain (without parser) took 141656.29ms. Allocated memory was 246.4MB in the beginning and 7.5GB in the end (delta: 7.3GB). Free memory was 195.8MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 6.7GB. Max. memory is 8.0GB. [2023-12-19 01:41:58,138 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 174.1MB. Free memory was 126.3MB in the beginning and 126.1MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 01:41:58,138 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.74ms. Allocated memory is still 246.4MB. Free memory was 195.5MB in the beginning and 176.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-19 01:41:58,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.59ms. Allocated memory is still 246.4MB. Free memory was 176.6MB in the beginning and 173.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 01:41:58,139 INFO L158 Benchmark]: Boogie Preprocessor took 87.02ms. Allocated memory is still 246.4MB. Free memory was 173.4MB in the beginning and 169.9MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 01:41:58,139 INFO L158 Benchmark]: RCFGBuilder took 708.53ms. Allocated memory is still 246.4MB. Free memory was 169.9MB in the beginning and 202.2MB in the end (delta: -32.2MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. [2023-12-19 01:41:58,139 INFO L158 Benchmark]: TraceAbstraction took 140499.83ms. Allocated memory was 246.4MB in the beginning and 7.5GB in the end (delta: 7.3GB). Free memory was 201.1MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 6.7GB. Max. memory is 8.0GB. [2023-12-19 01:41:58,140 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.43ms. Allocated memory is still 174.1MB. Free memory was 126.3MB in the beginning and 126.1MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 293.74ms. Allocated memory is still 246.4MB. Free memory was 195.5MB in the beginning and 176.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.59ms. Allocated memory is still 246.4MB. Free memory was 176.6MB in the beginning and 173.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 87.02ms. Allocated memory is still 246.4MB. Free memory was 173.4MB in the beginning and 169.9MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 708.53ms. Allocated memory is still 246.4MB. Free memory was 169.9MB in the beginning and 202.2MB in the end (delta: -32.2MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. * TraceAbstraction took 140499.83ms. Allocated memory was 246.4MB in the beginning and 7.5GB in the end (delta: 7.3GB). Free memory was 201.1MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 6.7GB. 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, 222 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 140.4s, OverallIterations: 31, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.7s, AutomataDifference: 43.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 53.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9989 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9749 mSDsluCounter, 15179 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9524 mSDsCounter, 1490 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13122 IncrementalHoareTripleChecker+Invalid, 14612 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1490 mSolverCounterUnsat, 5655 mSDtfsCounter, 13122 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3323 GetRequests, 3038 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62381occurred in iteration=18, InterpolantAutomatonStates: 248, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 33.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 49571 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 54 LocationsWithAnnotation, 45231 PreInvPairs, 46187 NumberOfFragments, 13642 HoareAnnotationTreeSize, 45231 FormulaSimplifications, 231057 FormulaSimplificationTreeSizeReduction, 24.3s HoareSimplificationTime, 54 FormulaSimplificationsInter, 232471 FormulaSimplificationTreeSizeReductionInter, 28.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 5963 NumberOfCodeBlocks, 5963 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 5915 ConstructedInterpolants, 0 QuantifiedInterpolants, 10002 SizeOfPredicates, 3 NumberOfNonLiveVariables, 8896 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 48 InterpolantComputations, 31 PerfectInterpolantSequences, 2766/3189 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: 640]: Loop Invariant Derived loop invariant: (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (t2_pc <= 0)) || (((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (token == (2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st))) || ((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (2 <= t2_st))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st))) || ((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= T1_E)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: ((((p_dw_pc == 0) && (c_dr_pc == 0)) || ((p_dw_pc == 0) && (c_dr_pc == 1))) || (!((c_dr_pc == 2)) && (1 <= p_dw_pc))) - InvariantResult [Line: 720]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0))) || (((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (2 <= T1_E)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0))) || ((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (m_st == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (token == (2 + local))) && (t2_i == 1)) && (c_dr_pc == 0))) - InvariantResult [Line: 1132]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (2 <= T1_E)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0)) || ((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st))) || (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && ((local + 1) == token)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st))) || (((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (2 <= t2_st))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (2 <= t2_st))) || ((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st))) || (((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (t2_pc <= 0))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (t2_pc <= 0))) || (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (2 <= t2_st))) || (((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (t2_pc <= 0))) || ((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (m_st == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (token == (2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st))) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (!((c_dr_pc == 2)) && ((p_dw_pc == 0) || (0 < p_dw_pc))) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (2 <= T1_E)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0)) || ((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st))) || (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && ((local + 1) == token)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st))) || (((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (2 <= t2_st))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (2 <= t2_st))) || ((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st))) || (((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (t2_pc <= 0))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (t2_pc <= 0))) || (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (2 <= t2_st))) || (((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (t2_pc <= 0))) || ((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (m_st == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (token == (2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st))) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((((p_dw_pc == 0) && (c_dr_pc == 0)) || ((p_dw_pc == 0) && (c_dr_pc == 1))) || (!((c_dr_pc == 2)) && (1 <= p_dw_pc))) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: (((0 < p_dw_pc) || ((p_dw_pc == 0) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 1))) - InvariantResult [Line: 684]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (2 <= t2_st)) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (t2_pc <= 0))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (2 <= T1_E)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st))) || ((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && ((local + 1) == token)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st))) RESULT: Ultimate proved your program to be correct! [2023-12-19 01:41:58,167 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...