/root/.sdkman/candidates/java/current/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-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_AUTOMATON -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/clever.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:14:56,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:14:56,326 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-09 23:14:56,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:14:56,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:14:56,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-09 23:14:56,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:14:56,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:14:56,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:14:56,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:14:56,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:14:56,368 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:14:56,368 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:14:56,369 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:14:56,370 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:14:56,370 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:14:56,370 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:14:56,370 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:14:56,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:14:56,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:14:56,371 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:14:56,371 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:14:56,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:14:56,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:14:56,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:14:56,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:14:56,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:14:56,372 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:14:56,372 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:14:56,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:14:56,373 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:14:56,373 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:14:56,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:14:56,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:14:56,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:14:56,374 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:14:56,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:14:56,375 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:14:56,375 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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.buchiautomizer: Automaton type for concurrent programs -> BUCHI_AUTOMATON [2024-02-09 23:14:56,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:14:56,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:14:56,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:14:56,653 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-09 23:14:56,654 INFO L274 PluginConnector]: CDTParser initialized [2024-02-09 23:14:56,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/clever.wvr.c [2024-02-09 23:14:57,702 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-09 23:14:57,844 INFO L384 CDTParser]: Found 1 translation units. [2024-02-09 23:14:57,844 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c [2024-02-09 23:14:57,859 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dc86af48/533fa0c08d424adf85a44953076e4c63/FLAG9f2375e32 [2024-02-09 23:14:57,871 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dc86af48/533fa0c08d424adf85a44953076e4c63 [2024-02-09 23:14:57,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:14:57,876 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-09 23:14:57,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-09 23:14:57,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-09 23:14:57,882 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-09 23:14:57,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 11:14:57" (1/1) ... [2024-02-09 23:14:57,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57513bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:14:57, skipping insertion in model container [2024-02-09 23:14:57,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 11:14:57" (1/1) ... [2024-02-09 23:14:57,901 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-09 23:14:58,042 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-09 23:14:58,050 INFO L202 MainTranslator]: Completed pre-run [2024-02-09 23:14:58,077 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-09 23:14:58,088 INFO L206 MainTranslator]: Completed translation [2024-02-09 23:14:58,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:14:58 WrapperNode [2024-02-09 23:14:58,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-09 23:14:58,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:14:58,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:14:58,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:14:58,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:14:58" (1/1) ... [2024-02-09 23:14:58,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:14:58" (1/1) ... [2024-02-09 23:14:58,129 INFO L138 Inliner]: procedures = 19, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 81 [2024-02-09 23:14:58,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:14:58,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:14:58,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:14:58,130 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:14:58,136 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:14:58" (1/1) ... [2024-02-09 23:14:58,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:14:58" (1/1) ... [2024-02-09 23:14:58,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:14:58" (1/1) ... [2024-02-09 23:14:58,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:14:58" (1/1) ... [2024-02-09 23:14:58,142 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:14:58" (1/1) ... [2024-02-09 23:14:58,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:14:58" (1/1) ... [2024-02-09 23:14:58,147 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:14:58" (1/1) ... [2024-02-09 23:14:58,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:14:58" (1/1) ... [2024-02-09 23:14:58,149 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:14:58,150 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:14:58,150 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:14:58,150 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:14:58,150 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:14:58" (1/1) ... [2024-02-09 23:14:58,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:14:58,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:14:58,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:14:58,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-09 23:14:58,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-09 23:14:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-09 23:14:58,210 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-09 23:14:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-09 23:14:58,210 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-09 23:14:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-02-09 23:14:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-09 23:14:58,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-02-09 23:14:58,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:14:58,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:14:58,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-02-09 23:14:58,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-09 23:14:58,212 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-09 23:14:58,282 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:14:58,284 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:14:58,448 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:14:58,454 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:14:58,454 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2024-02-09 23:14:58,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:14:58 BoogieIcfgContainer [2024-02-09 23:14:58,456 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:14:58,457 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:14:58,457 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:14:58,460 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:14:58,460 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:14:58,460 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.02 11:14:57" (1/3) ... [2024-02-09 23:14:58,461 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@796bc4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:14:58, skipping insertion in model container [2024-02-09 23:14:58,461 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:14:58,461 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:14:58" (2/3) ... [2024-02-09 23:14:58,461 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@796bc4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:14:58, skipping insertion in model container [2024-02-09 23:14:58,461 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:14:58,461 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:14:58" (3/3) ... [2024-02-09 23:14:58,462 INFO L332 chiAutomizerObserver]: Analyzing ICFG clever.wvr.c [2024-02-09 23:14:58,525 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-09 23:14:58,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 123 transitions, 260 flow [2024-02-09 23:14:58,625 INFO L124 PetriNetUnfolderBase]: 9/119 cut-off events. [2024-02-09 23:14:58,625 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-09 23:14:58,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 119 events. 9/119 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2024-02-09 23:14:58,632 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 123 transitions, 260 flow [2024-02-09 23:14:58,641 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 119 transitions, 250 flow [2024-02-09 23:14:58,653 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:14:58,653 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:14:58,653 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:14:58,653 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:14:58,653 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:14:58,653 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:14:58,653 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:14:58,654 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-02-09 23:14:58,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2024-02-09 23:14:58,775 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 531 [2024-02-09 23:14:58,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:14:58,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:14:58,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem 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] [2024-02-09 23:14:58,781 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-02-09 23:14:58,782 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:14:58,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 670 states, but on-demand construction may add more states [2024-02-09 23:14:58,802 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 531 [2024-02-09 23:14:58,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:14:58,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:14:58,804 INFO L148 hiAutomatonCegarLoop]: Counterexample stem 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] [2024-02-09 23:14:58,804 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-02-09 23:14:58,809 INFO L748 eck$LassoCheckResult]: Stem: 122#[$Ultimate##0]don't care [180] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[] 125#[L-1]don't care [186] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 127#[L21]don't care [228] L21-->L21-1: Formula: (and (= (select |v_#valid_7| 1) 1) (= (select |v_#length_2| 1) 2)) InVars {#length=|v_#length_2|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] 129#[L21-1]don't care [252] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_2| 1) 0) 48) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 131#[L21-2]don't care [190] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_3| 1) 1) 0) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] 133#[L21-3]don't care [218] L21-3-->L21-4: Formula: (and (= (select |v_#length_3| 2) 13) (= (select |v_#valid_8| 2) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[] 135#[L21-4]don't care [203] L21-4-->L36: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0] 137#[L36]don't care [259] L36-->L36-1: Formula: (= v_~m~0_4 0) InVars {} OutVars{~m~0=v_~m~0_4} AuxVars[] AssignedVars[~m~0] 139#[L36-1]don't care [247] L36-1-->L36-2: Formula: (= v_~i1~0_5 0) InVars {} OutVars{~i1~0=v_~i1~0_5} AuxVars[] AssignedVars[~i1~0] 141#[L36-2]don't care [235] L36-2-->L36-3: Formula: (= v_~i2~0_5 0) InVars {} OutVars{~i2~0=v_~i2~0_5} AuxVars[] AssignedVars[~i2~0] 143#[L36-3]don't care [210] L36-3-->L37: Formula: (= v_~j1~0_6 0) InVars {} OutVars{~j1~0=v_~j1~0_6} AuxVars[] AssignedVars[~j1~0] 145#[L37]don't care [197] L37-->L37-1: Formula: (= v_~k1~0_4 0) InVars {} OutVars{~k1~0=v_~k1~0_4} AuxVars[] AssignedVars[~k1~0] 147#[L37-1]don't care [198] L37-1-->L-1-1: Formula: (= v_~k2~0_4 0) InVars {} OutVars{~k2~0=v_~k2~0_4} AuxVars[] AssignedVars[~k2~0] 149#[L-1-1]don't care [261] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 151#[L-1-2]don't care [264] L-1-2-->L60: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_4|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base] 153#[L60]don't care [267] L60-->L60-1: Formula: (and (= (store |v_#length_5| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_4|) (= |v_#valid_9| (store |v_#valid_10| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 155#[L60-1]don't care [184] L60-1-->L60-2: Formula: (and (= (store |v_#valid_12| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_11|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, #valid=|v_#valid_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 157#[L60-2]don't care [175] L60-2-->L63: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 159#[L63]don't care [159] L63-->L63-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_4| v_~n~0_6) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} OutVars{~n~0=v_~n~0_6, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[~n~0] 161#[L63-1]don't care [246] L63-1-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 163#[L64]don't care [171] L64-->L64-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 165#[L64-1]don't care [263] L64-1-->L64-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet6#1_4| v_~m~0_5) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} OutVars{~m~0=v_~m~0_5, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[~m~0] 167#[L64-2]don't care [276] L64-2-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 169#[L65]don't care [277] L65-->L65-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 171#[L65-1]don't care [196] L65-1-->L65-2: Formula: (= v_~i1~0_6 |v_ULTIMATE.start_main_#t~nondet7#1_4|) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|, ~i1~0=v_~i1~0_6} AuxVars[] AssignedVars[~i1~0] 173#[L65-2]don't care [185] L65-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 175#[L66]don't care [182] L66-->L66-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 177#[L66-1]don't care [199] L66-1-->L66-2: Formula: (= v_~i2~0_6 |v_ULTIMATE.start_main_#t~nondet8#1_4|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|, ~i2~0=v_~i2~0_6} AuxVars[] AssignedVars[~i2~0] 179#[L66-2]don't care [187] L66-2-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 181#[L67]don't care [254] L67-->L67-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 183#[L67-1]don't care [226] L67-1-->L67-2: Formula: (= v_~j1~0_7 |v_ULTIMATE.start_main_#t~nondet9#1_4|) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|, ~j1~0=v_~j1~0_7} AuxVars[] AssignedVars[~j1~0] 185#[L67-2]don't care [167] L67-2-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 187#[L68]don't care [260] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 189#[L68-1]don't care [225] L68-1-->L68-2: Formula: (= v_~k1~0_5 |v_ULTIMATE.start_main_#t~nondet10#1_4|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} OutVars{~k1~0=v_~k1~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[~k1~0] 191#[L68-2]don't care [211] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 193#[L69]don't care [168] L69-->L69-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 195#[L69-1]don't care [265] L69-1-->L69-2: Formula: (= v_~k2~0_5 |v_ULTIMATE.start_main_#t~nondet11#1_4|) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} OutVars{~k2~0=v_~k2~0_5, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[~k2~0] 197#[L69-2]don't care [232] L69-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 199#[L72]don't care [204] L72-->L72-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (let ((.cse0 (mod v_~i1~0_7 4294967296))) (and (= .cse0 (mod v_~k2~0_6 4294967296)) (= (mod v_~k1~0_6 4294967296) .cse0) (= v_~i1~0_7 v_~i2~0_7) (= v_~i1~0_7 0))) 1 0)) InVars {~i2~0=v_~i2~0_7, ~i1~0=v_~i1~0_7, ~k1~0=v_~k1~0_6, ~k2~0=v_~k2~0_6} OutVars{~i2~0=v_~i2~0_7, ~i1~0=v_~i1~0_7, ~k1~0=v_~k1~0_6, ~k2~0=v_~k2~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 201#[L72-1]don't care [207] L72-1-->L32: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 203#[L32]don't care [223] L32-->L33: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 205#[L33]don't care [174] L33-->L32-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[] 209#[L32-1]don't care [183] L32-1-->L72-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 211#[L72-2]don't care [164] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 213#[L73]don't care [229] L73-->L73-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (<= 0 v_~m~0_6) 1 0)) InVars {~m~0=v_~m~0_6} OutVars{~m~0=v_~m~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 215#[L73-1]don't care [243] L73-1-->L32-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 217#[L32-2]don't care [236] L32-2-->L33-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 219#[L33-3]don't care [275] L33-3-->L32-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[] 223#[L32-3]don't care [227] L32-3-->L73-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 225#[L73-2]don't care [181] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 227#[L75]don't care [200] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_3| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1] 229#[L75-1]don't care [179] L75-1-->L75-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 231#[L75-2]don't care [251] L75-2-->L75-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_6|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 4) (select |v_#length_8| |v_ULTIMATE.start_main_~#t1~0#1.base_6|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_main_~#t1~0#1.base_6| (store (select |v_#memory_int_5| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) |v_ULTIMATE.start_main_~#t1~0#1.offset_6| |v_ULTIMATE.start_main_#t~pre12#1_4|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 1)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|} AuxVars[] AssignedVars[#memory_int] 233#[L75-3]don't care [307] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 235#[L75-4, L40-1]don't care [2024-02-09 23:14:58,810 INFO L750 eck$LassoCheckResult]: Loop: 235#[L75-4, L40-1]don't care [278] L40-1-->L41: Formula: (< v_~i1~0_2 v_~n~0_2) InVars {~n~0=v_~n~0_2, ~i1~0=v_~i1~0_2} OutVars{~n~0=v_~n~0_2, ~i1~0=v_~i1~0_2} AuxVars[] AssignedVars[] 237#[L75-4, L41]don't care [281] L41-->L41-6: Formula: (= v_~j1~0_1 0) InVars {} OutVars{~j1~0=v_~j1~0_1} AuxVars[] AssignedVars[~j1~0] 243#[L75-4, L41-6]don't care [284] L41-6-->L41-7: Formula: (<= v_~m~0_1 v_~j1~0_2) InVars {~j1~0=v_~j1~0_2, ~m~0=v_~m~0_1} OutVars{~j1~0=v_~j1~0_2, ~m~0=v_~m~0_1} AuxVars[] AssignedVars[] 255#[L75-4, L41-7]don't care [288] L41-7-->L44: Formula: (= v_~i1~0_3 |v_thread1Thread1of1ForFork0_#t~post3_1|) InVars {~i1~0=v_~i1~0_3} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_1|, ~i1~0=v_~i1~0_3} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3] 273#[L75-4, L44]don't care [290] L44-->L44-1: Formula: (= v_~i1~0_4 (+ |v_thread1Thread1of1ForFork0_#t~post3_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_3|} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_3|, ~i1~0=v_~i1~0_4} AuxVars[] AssignedVars[~i1~0] 295#[L75-4, L44-1]don't care [292] L44-1-->L40-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3] 235#[L75-4, L40-1]don't care [2024-02-09 23:14:58,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:14:58,814 INFO L85 PathProgramCache]: Analyzing trace with hash 395945615, now seen corresponding path program 1 times [2024-02-09 23:14:58,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:14:58,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382889390] [2024-02-09 23:14:58,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:14:58,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:14:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:14:58,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:14:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:14:59,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:14:59,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:14:59,012 INFO L85 PathProgramCache]: Analyzing trace with hash 524729162, now seen corresponding path program 1 times [2024-02-09 23:14:59,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:14:59,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563779887] [2024-02-09 23:14:59,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:14:59,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:14:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:14:59,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:14:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:14:59,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:14:59,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:14:59,025 INFO L85 PathProgramCache]: Analyzing trace with hash 37797720, now seen corresponding path program 1 times [2024-02-09 23:14:59,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:14:59,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210043438] [2024-02-09 23:14:59,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:14:59,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:14:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:14:59,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:14:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:14:59,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:14:59,247 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:14:59,248 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:14:59,248 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:14:59,271 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:14:59,271 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-09 23:14:59,271 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:14:59,271 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:14:59,271 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:14:59,271 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration1_Loop [2024-02-09 23:14:59,271 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:14:59,272 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:14:59,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:14:59,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:14:59,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:14:59,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:14:59,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:14:59,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:14:59,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:14:59,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:14:59,390 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:14:59,391 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-09 23:14:59,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:14:59,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:14:59,395 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:14:59,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-09 23:14:59,419 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:14:59,419 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:14:59,439 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:14:59,439 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_1=1} Honda state: {v_rep#funAddr~thread2.offset_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-09 23:14:59,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-02-09 23:14:59,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:14:59,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:14:59,447 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:14:59,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-09 23:14:59,450 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:14:59,451 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:14:59,470 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:14:59,470 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_1=-1} Honda state: {v_rep#funAddr~thread1.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-09 23:14:59,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-02-09 23:14:59,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:14:59,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:14:59,491 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:14:59,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-09 23:14:59,496 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:14:59,496 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:14:59,510 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:14:59,511 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_#t~post3=0} Honda state: {thread1Thread1of1ForFork0_#t~post3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-09 23:14:59,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-02-09 23:14:59,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:14:59,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:14:59,517 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:14:59,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-09 23:14:59,522 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:14:59,526 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:14:59,544 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:14:59,544 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_1=0} Honda state: {v_rep#funAddr~thread1.offset_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-09 23:14:59,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-09 23:14:59,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:14:59,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:14:59,552 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:14:59,557 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:14:59,558 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:14:59,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-09 23:14:59,576 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:14:59,577 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~m~0=0} Honda state: {~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-09 23:14:59,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-02-09 23:14:59,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:14:59,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:14:59,585 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:14:59,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-09 23:14:59,590 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:14:59,590 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:14:59,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-02-09 23:14:59,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:14:59,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:14:59,622 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:14:59,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-02-09 23:14:59,624 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-09 23:14:59,624 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:14:59,740 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-09 23:14:59,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-09 23:14:59,743 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:14:59,743 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:14:59,743 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:14:59,743 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:14:59,743 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:14:59,743 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:14:59,744 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:14:59,744 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:14:59,744 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration1_Loop [2024-02-09 23:14:59,744 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:14:59,744 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:14:59,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:14:59,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:14:59,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:14:59,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:14:59,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:14:59,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:14:59,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:14:59,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:14:59,844 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:14:59,848 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:14:59,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:14:59,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:14:59,863 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:14:59,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:14:59,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:14:59,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:14:59,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:14:59,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:14:59,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:14:59,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:14:59,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-09 23:14:59,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:14:59,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-02-09 23:14:59,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:14:59,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:14:59,920 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:14:59,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:14:59,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:14:59,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:14:59,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:14:59,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:14:59,935 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:14:59,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:14:59,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-02-09 23:14:59,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:14:59,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-02-09 23:14:59,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:14:59,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:14:59,962 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:14:59,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:14:59,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:14:59,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:14:59,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:14:59,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:14:59,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:14:59,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-02-09 23:14:59,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:14:59,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:15:00,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:00,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:00,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:00,002 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:00,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:15:00,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-02-09 23:15:00,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:15:00,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:15:00,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:15:00,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:15:00,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:15:00,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:15:00,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:15:00,030 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:15:00,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:00,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:00,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:00,037 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:00,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:15:00,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:15:00,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:15:00,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:15:00,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:15:00,052 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:15:00,052 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:15:00,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-09 23:15:00,064 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:15:00,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:00,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:00,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:00,071 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:00,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:15:00,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:15:00,082 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:15:00,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:15:00,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:15:00,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:15:00,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:15:00,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:15:00,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-02-09 23:15:00,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:15:00,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:00,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:00,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:00,102 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:00,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:15:00,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-02-09 23:15:00,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:15:00,130 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:15:00,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:15:00,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:15:00,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:15:00,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:15:00,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:15:00,148 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:15:00,169 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-09 23:15:00,169 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-09 23:15:00,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:00,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:00,173 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:00,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-02-09 23:15:00,177 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:15:00,177 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-09 23:15:00,177 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:15:00,177 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i1~0, ~n~0) = -1*~i1~0 + 1*~n~0 Supporting invariants [] [2024-02-09 23:15:00,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:00,187 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:15:00,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:15:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:15:00,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:15:00,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:15:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:15:00,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-09 23:15:00,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:15:00,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:15:00,442 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-02-09 23:15:00,445 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 670 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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) [2024-02-09 23:15:00,603 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 670 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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) Result 2005 states and 5557 transitions. Complement of second has 9 states. [2024-02-09 23:15:00,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-02-09 23:15:00,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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) [2024-02-09 23:15:00,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 242 transitions. [2024-02-09 23:15:00,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 242 transitions. Stem has 54 letters. Loop has 6 letters. [2024-02-09 23:15:00,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:15:00,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 242 transitions. Stem has 60 letters. Loop has 6 letters. [2024-02-09 23:15:00,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:15:00,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 242 transitions. Stem has 54 letters. Loop has 12 letters. [2024-02-09 23:15:00,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:15:00,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2005 states and 5557 transitions. [2024-02-09 23:15:00,640 INFO L131 ngComponentsAnalysis]: Automaton has 57 accepting balls. 441 [2024-02-09 23:15:00,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2005 states to 1147 states and 3081 transitions. [2024-02-09 23:15:00,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 577 [2024-02-09 23:15:00,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 654 [2024-02-09 23:15:00,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1147 states and 3081 transitions. [2024-02-09 23:15:00,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:15:00,667 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1147 states and 3081 transitions. [2024-02-09 23:15:00,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states and 3081 transitions. [2024-02-09 23:15:00,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1072. [2024-02-09 23:15:00,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1072 states have (on average 2.666044776119403) internal successors, (2858), 1071 states have internal predecessors, (2858), 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) [2024-02-09 23:15:00,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 2858 transitions. [2024-02-09 23:15:00,737 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1072 states and 2858 transitions. [2024-02-09 23:15:00,737 INFO L428 stractBuchiCegarLoop]: Abstraction has 1072 states and 2858 transitions. [2024-02-09 23:15:00,737 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:15:00,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1072 states and 2858 transitions. [2024-02-09 23:15:00,742 INFO L131 ngComponentsAnalysis]: Automaton has 57 accepting balls. 441 [2024-02-09 23:15:00,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:15:00,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:15:00,745 INFO L148 hiAutomatonCegarLoop]: Counterexample stem 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] [2024-02-09 23:15:00,745 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:15:00,746 INFO L748 eck$LassoCheckResult]: Stem: 5145#[$Ultimate##0]don't care [180] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[] 5147#[L-1]don't care [186] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 5761#[L21]don't care [228] L21-->L21-1: Formula: (and (= (select |v_#valid_7| 1) 1) (= (select |v_#length_2| 1) 2)) InVars {#length=|v_#length_2|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] 5507#[L21-1]don't care [252] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_2| 1) 0) 48) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 5243#[L21-2]don't care [190] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_3| 1) 1) 0) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] 5245#[L21-3]don't care [218] L21-3-->L21-4: Formula: (and (= (select |v_#length_3| 2) 13) (= (select |v_#valid_8| 2) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[] 4265#[L21-4]don't care [203] L21-4-->L36: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0] 4267#[L36]don't care [259] L36-->L36-1: Formula: (= v_~m~0_4 0) InVars {} OutVars{~m~0=v_~m~0_4} AuxVars[] AssignedVars[~m~0] 4943#[L36-1]don't care [247] L36-1-->L36-2: Formula: (= v_~i1~0_5 0) InVars {} OutVars{~i1~0=v_~i1~0_5} AuxVars[] AssignedVars[~i1~0] 5491#[L36-2]don't care [235] L36-2-->L36-3: Formula: (= v_~i2~0_5 0) InVars {} OutVars{~i2~0=v_~i2~0_5} AuxVars[] AssignedVars[~i2~0] 5397#[L36-3]don't care [210] L36-3-->L37: Formula: (= v_~j1~0_6 0) InVars {} OutVars{~j1~0=v_~j1~0_6} AuxVars[] AssignedVars[~j1~0] 4157#[L37]don't care [197] L37-->L37-1: Formula: (= v_~k1~0_4 0) InVars {} OutVars{~k1~0=v_~k1~0_4} AuxVars[] AssignedVars[~k1~0] 4159#[L37-1]don't care [198] L37-1-->L-1-1: Formula: (= v_~k2~0_4 0) InVars {} OutVars{~k2~0=v_~k2~0_4} AuxVars[] AssignedVars[~k2~0] 5811#[L-1-1]don't care [261] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 5821#[L-1-2]don't care [264] L-1-2-->L60: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_4|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base] 5549#[L60]don't care [267] L60-->L60-1: Formula: (and (= (store |v_#length_5| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_4|) (= |v_#valid_9| (store |v_#valid_10| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 5199#[L60-1]don't care [184] L60-1-->L60-2: Formula: (and (= (store |v_#valid_12| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_11|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, #valid=|v_#valid_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 5117#[L60-2]don't care [175] L60-2-->L63: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 5119#[L63]don't care [159] L63-->L63-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_4| v_~n~0_6) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} OutVars{~n~0=v_~n~0_6, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[~n~0] 5773#[L63-1]don't care [246] L63-1-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 5109#[L64]don't care [171] L64-->L64-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 5111#[L64-1]don't care [263] L64-1-->L64-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet6#1_4| v_~m~0_5) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} OutVars{~m~0=v_~m~0_5, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[~m~0] 5785#[L64-2]don't care [276] L64-2-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 5787#[L65]don't care [277] L65-->L65-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 4135#[L65-1]don't care [196] L65-1-->L65-2: Formula: (= v_~i1~0_6 |v_ULTIMATE.start_main_#t~nondet7#1_4|) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|, ~i1~0=v_~i1~0_6} AuxVars[] AssignedVars[~i1~0] 4137#[L65-2]don't care [185] L65-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 3967#[L66]don't care [182] L66-->L66-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 3969#[L66-1]don't care [199] L66-1-->L66-2: Formula: (= v_~i2~0_6 |v_ULTIMATE.start_main_#t~nondet8#1_4|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|, ~i2~0=v_~i2~0_6} AuxVars[] AssignedVars[~i2~0] 4181#[L66-2]don't care [187] L66-2-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 5201#[L67]don't care [254] L67-->L67-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 5513#[L67-1]don't care [226] L67-1-->L67-2: Formula: (= v_~j1~0_7 |v_ULTIMATE.start_main_#t~nondet9#1_4|) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|, ~j1~0=v_~j1~0_7} AuxVars[] AssignedVars[~j1~0] 5747#[L67-2]don't care [167] L67-2-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 5529#[L68]don't care [260] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 4587#[L68-1]don't care [225] L68-1-->L68-2: Formula: (= v_~k1~0_5 |v_ULTIMATE.start_main_#t~nondet10#1_4|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} OutVars{~k1~0=v_~k1~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[~k1~0] 4589#[L68-2]don't care [211] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 3773#[L69]don't care [168] L69-->L69-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 3775#[L69-1]don't care [265] L69-1-->L69-2: Formula: (= v_~k2~0_5 |v_ULTIMATE.start_main_#t~nondet11#1_4|) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} OutVars{~k2~0=v_~k2~0_5, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[~k2~0] 4959#[L69-2]don't care [232] L69-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 5701#[L72]don't care [204] L72-->L72-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (let ((.cse0 (mod v_~i1~0_7 4294967296))) (and (= .cse0 (mod v_~k2~0_6 4294967296)) (= (mod v_~k1~0_6 4294967296) .cse0) (= v_~i1~0_7 v_~i2~0_7) (= v_~i1~0_7 0))) 1 0)) InVars {~i2~0=v_~i2~0_7, ~i1~0=v_~i1~0_7, ~k1~0=v_~k1~0_6, ~k2~0=v_~k2~0_6} OutVars{~i2~0=v_~i2~0_7, ~i1~0=v_~i1~0_7, ~k1~0=v_~k1~0_6, ~k2~0=v_~k2~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5359#[L72-1]don't care [207] L72-1-->L32: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 5361#[L32]don't care [223] L32-->L33: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 5449#[L33]don't care [174] L33-->L32-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[] 3971#[L32-1]don't care [183] L32-1-->L72-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 3973#[L72-2]don't care [164] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4665#[L73]don't care [229] L73-->L73-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (<= 0 v_~m~0_6) 1 0)) InVars {~m~0=v_~m~0_6} OutVars{~m~0=v_~m~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4667#[L73-1]don't care [243] L73-1-->L32-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 5501#[L32-2]don't care [236] L32-2-->L33-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 5557#[L33-3]don't care [275] L33-3-->L32-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[] 4611#[L32-3]don't care [227] L32-3-->L73-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 4613#[L73-2]don't care [181] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5631#[L75]don't care [200] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_3| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1] 5143#[L75-1]don't care [179] L75-1-->L75-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 4869#[L75-2]don't care [251] L75-2-->L75-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_6|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 4) (select |v_#length_8| |v_ULTIMATE.start_main_~#t1~0#1.base_6|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_main_~#t1~0#1.base_6| (store (select |v_#memory_int_5| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) |v_ULTIMATE.start_main_~#t1~0#1.offset_6| |v_ULTIMATE.start_main_#t~pre12#1_4|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 1)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|} AuxVars[] AssignedVars[#memory_int] 4871#[L75-3]don't care [307] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 5813#[L75-4, L40-1]don't care [278] L40-1-->L41: Formula: (< v_~i1~0_2 v_~n~0_2) InVars {~n~0=v_~n~0_2, ~i1~0=v_~i1~0_2} OutVars{~n~0=v_~n~0_2, ~i1~0=v_~i1~0_2} AuxVars[] AssignedVars[] 3929#[L75-4, L41]don't care [281] L41-->L41-6: Formula: (= v_~j1~0_1 0) InVars {} OutVars{~j1~0=v_~j1~0_1} AuxVars[] AssignedVars[~j1~0] 3931#[L75-4, L41-6]don't care [2024-02-09 23:15:00,746 INFO L750 eck$LassoCheckResult]: Loop: 3931#[L75-4, L41-6]don't care [283] L41-6-->L42: Formula: (< v_~j1~0_3 v_~m~0_2) InVars {~j1~0=v_~j1~0_3, ~m~0=v_~m~0_2} OutVars{~j1~0=v_~j1~0_3, ~m~0=v_~m~0_2} AuxVars[] AssignedVars[] 4829#[L75-4, L42]don't care [287] L42-->L42-1: Formula: (= v_~k1~0_1 |v_thread1Thread1of1ForFork0_#t~post2_1|) InVars {~k1~0=v_~k1~0_1} OutVars{~k1~0=v_~k1~0_1, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2] 5657#[L75-4, L42-1]don't care [289] L42-1-->L42-2: Formula: (= v_~k1~0_2 (+ |v_thread1Thread1of1ForFork0_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_3|} OutVars{~k1~0=v_~k1~0_2, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_3|} AuxVars[] AssignedVars[~k1~0] 5817#[L75-4, L42-2]don't care [291] L42-2-->L41-3: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2] 5595#[L41-3, L75-4]don't care [293] L41-3-->L41-4: Formula: (= v_~j1~0_4 |v_thread1Thread1of1ForFork0_#t~post1_1|) InVars {~j1~0=v_~j1~0_4} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, ~j1~0=v_~j1~0_4} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 5029#[L75-4, L41-4]don't care [294] L41-4-->L41-5: Formula: (= v_~j1~0_5 (+ |v_thread1Thread1of1ForFork0_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|, ~j1~0=v_~j1~0_5} AuxVars[] AssignedVars[~j1~0] 5021#[L75-4, L41-5]don't care [295] L41-5-->L41-6: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 3931#[L75-4, L41-6]don't care [2024-02-09 23:15:00,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:15:00,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1748344430, now seen corresponding path program 1 times [2024-02-09 23:15:00,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:15:00,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731732195] [2024-02-09 23:15:00,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:15:00,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:15:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:15:00,794 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:15:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:15:00,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:15:00,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:15:00,815 INFO L85 PathProgramCache]: Analyzing trace with hash -594228929, now seen corresponding path program 1 times [2024-02-09 23:15:00,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:15:00,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797679379] [2024-02-09 23:15:00,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:15:00,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:15:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:15:00,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:15:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:15:00,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:15:00,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:15:00,822 INFO L85 PathProgramCache]: Analyzing trace with hash -166350194, now seen corresponding path program 1 times [2024-02-09 23:15:00,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:15:00,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615218097] [2024-02-09 23:15:00,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:15:00,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:15:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:15:00,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:15:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:15:00,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:15:00,914 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:15:00,914 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:15:00,914 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:15:00,914 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:15:00,915 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-09 23:15:00,915 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:00,915 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:15:00,915 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:15:00,915 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration2_Loop [2024-02-09 23:15:00,915 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:15:00,915 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:15:00,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:00,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:00,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:00,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:00,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:00,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:00,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:00,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:00,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:01,013 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:15:01,013 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-09 23:15:01,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:01,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:01,017 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:01,020 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:15:01,020 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:15:01,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-02-09 23:15:01,038 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:15:01,038 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_3=1} Honda state: {v_rep#funAddr~thread2.offset_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-09 23:15:01,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:01,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:01,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:01,044 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:01,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-02-09 23:15:01,048 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:15:01,048 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:15:01,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:01,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:01,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:01,077 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:01,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-02-09 23:15:01,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-09 23:15:01,081 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:15:01,188 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-09 23:15:01,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:01,204 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:15:01,204 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:15:01,204 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:15:01,204 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:15:01,205 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:15:01,205 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:01,205 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:15:01,205 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:15:01,205 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration2_Loop [2024-02-09 23:15:01,205 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:15:01,205 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:15:01,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:01,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:01,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:01,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:01,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:01,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:01,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:01,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:01,281 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:15:01,281 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:15:01,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:01,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:01,282 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:01,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-02-09 23:15:01,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:15:01,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:15:01,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:15:01,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:15:01,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:15:01,308 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:15:01,308 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:15:01,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:15:01,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:01,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:01,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:01,331 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:01,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-02-09 23:15:01,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:15:01,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:15:01,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:15:01,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:15:01,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:15:01,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:15:01,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:15:01,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:15:01,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:01,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:01,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:01,381 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:01,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:15:01,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:15:01,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:15:01,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:15:01,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:15:01,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:15:01,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:15:01,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:15:01,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-02-09 23:15:01,406 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:15:01,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-02-09 23:15:01,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:01,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:01,410 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:01,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-02-09 23:15:01,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:15:01,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:15:01,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:15:01,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:15:01,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:15:01,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:15:01,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:15:01,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:15:01,435 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:15:01,437 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-02-09 23:15:01,437 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-02-09 23:15:01,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:01,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:01,438 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:01,440 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:15:01,440 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-09 23:15:01,440 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:15:01,441 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~j1~0, ~m~0) = -1*~j1~0 + 1*~m~0 Supporting invariants [] [2024-02-09 23:15:01,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-02-09 23:15:01,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:01,444 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:15:01,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:15:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:15:01,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:15:01,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:15:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:15:01,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-09 23:15:01,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:15:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:15:01,606 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-02-09 23:15:01,607 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1072 states and 2858 transitions. cyclomatic complexity: 1865 Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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) [2024-02-09 23:15:01,707 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1072 states and 2858 transitions. cyclomatic complexity: 1865. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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) Result 3707 states and 10455 transitions. Complement of second has 9 states. [2024-02-09 23:15:01,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-02-09 23:15:01,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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) [2024-02-09 23:15:01,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2024-02-09 23:15:01,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 168 transitions. Stem has 56 letters. Loop has 7 letters. [2024-02-09 23:15:01,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:15:01,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 168 transitions. Stem has 63 letters. Loop has 7 letters. [2024-02-09 23:15:01,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:15:01,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 168 transitions. Stem has 56 letters. Loop has 14 letters. [2024-02-09 23:15:01,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:15:01,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3707 states and 10455 transitions. [2024-02-09 23:15:01,752 INFO L131 ngComponentsAnalysis]: Automaton has 143 accepting balls. 871 [2024-02-09 23:15:01,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3707 states to 2707 states and 7564 transitions. [2024-02-09 23:15:01,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1186 [2024-02-09 23:15:01,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1289 [2024-02-09 23:15:01,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2707 states and 7564 transitions. [2024-02-09 23:15:01,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:15:01,782 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2707 states and 7564 transitions. [2024-02-09 23:15:01,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2707 states and 7564 transitions. [2024-02-09 23:15:01,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2707 to 2028. [2024-02-09 23:15:01,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2028 states, 2028 states have (on average 2.828895463510848) internal successors, (5737), 2027 states have internal predecessors, (5737), 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) [2024-02-09 23:15:01,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 2028 states and 5737 transitions. [2024-02-09 23:15:01,840 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2028 states and 5737 transitions. [2024-02-09 23:15:01,840 INFO L428 stractBuchiCegarLoop]: Abstraction has 2028 states and 5737 transitions. [2024-02-09 23:15:01,840 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-09 23:15:01,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2028 states and 5737 transitions. [2024-02-09 23:15:01,854 INFO L131 ngComponentsAnalysis]: Automaton has 93 accepting balls. 621 [2024-02-09 23:15:01,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:15:01,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:15:01,855 INFO L148 hiAutomatonCegarLoop]: Counterexample stem 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] [2024-02-09 23:15:01,855 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-02-09 23:15:01,856 INFO L748 eck$LassoCheckResult]: Stem: 11262#[$Ultimate##0]don't care [180] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[] 11264#[L-1]don't care [186] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 12148#[L21]don't care [228] L21-->L21-1: Formula: (and (= (select |v_#valid_7| 1) 1) (= (select |v_#length_2| 1) 2)) InVars {#length=|v_#length_2|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] 11748#[L21-1]don't care [252] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_2| 1) 0) 48) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 11370#[L21-2]don't care [190] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_3| 1) 1) 0) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] 11372#[L21-3]don't care [218] L21-3-->L21-4: Formula: (and (= (select |v_#length_3| 2) 13) (= (select |v_#valid_8| 2) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[] 10326#[L21-4]don't care [203] L21-4-->L36: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0] 10328#[L36]don't care [259] L36-->L36-1: Formula: (= v_~m~0_4 0) InVars {} OutVars{~m~0=v_~m~0_4} AuxVars[] AssignedVars[~m~0] 11028#[L36-1]don't care [247] L36-1-->L36-2: Formula: (= v_~i1~0_5 0) InVars {} OutVars{~i1~0=v_~i1~0_5} AuxVars[] AssignedVars[~i1~0] 11718#[L36-2]don't care [235] L36-2-->L36-3: Formula: (= v_~i2~0_5 0) InVars {} OutVars{~i2~0=v_~i2~0_5} AuxVars[] AssignedVars[~i2~0] 11550#[L36-3]don't care [210] L36-3-->L37: Formula: (= v_~j1~0_6 0) InVars {} OutVars{~j1~0=v_~j1~0_6} AuxVars[] AssignedVars[~j1~0] 10220#[L37]don't care [197] L37-->L37-1: Formula: (= v_~k1~0_4 0) InVars {} OutVars{~k1~0=v_~k1~0_4} AuxVars[] AssignedVars[~k1~0] 10222#[L37-1]don't care [198] L37-1-->L-1-1: Formula: (= v_~k2~0_4 0) InVars {} OutVars{~k2~0=v_~k2~0_4} AuxVars[] AssignedVars[~k2~0] 12330#[L-1-1]don't care [261] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 12414#[L-1-2]don't care [264] L-1-2-->L60: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_4|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base] 11794#[L60]don't care [267] L60-->L60-1: Formula: (and (= (store |v_#length_5| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_4|) (= |v_#valid_9| (store |v_#valid_10| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 11328#[L60-1]don't care [184] L60-1-->L60-2: Formula: (and (= (store |v_#valid_12| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_11|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, #valid=|v_#valid_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 11236#[L60-2]don't care [175] L60-2-->L63: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 11238#[L63]don't care [159] L63-->L63-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_4| v_~n~0_6) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} OutVars{~n~0=v_~n~0_6, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[~n~0] 12184#[L63-1]don't care [246] L63-1-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 11228#[L64]don't care [171] L64-->L64-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 11230#[L64-1]don't care [263] L64-1-->L64-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet6#1_4| v_~m~0_5) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} OutVars{~m~0=v_~m~0_5, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[~m~0] 12234#[L64-2]don't care [276] L64-2-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 12236#[L65]don't care [277] L65-->L65-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 10198#[L65-1]don't care [196] L65-1-->L65-2: Formula: (= v_~i1~0_6 |v_ULTIMATE.start_main_#t~nondet7#1_4|) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|, ~i1~0=v_~i1~0_6} AuxVars[] AssignedVars[~i1~0] 10200#[L65-2]don't care [185] L65-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 10036#[L66]don't care [182] L66-->L66-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 10038#[L66-1]don't care [199] L66-1-->L66-2: Formula: (= v_~i2~0_6 |v_ULTIMATE.start_main_#t~nondet8#1_4|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|, ~i2~0=v_~i2~0_6} AuxVars[] AssignedVars[~i2~0] 10246#[L66-2]don't care [187] L66-2-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 11336#[L67]don't care [254] L67-->L67-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 11754#[L67-1]don't care [226] L67-1-->L67-2: Formula: (= v_~j1~0_7 |v_ULTIMATE.start_main_#t~nondet9#1_4|) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|, ~j1~0=v_~j1~0_7} AuxVars[] AssignedVars[~j1~0] 12122#[L67-2]don't care [167] L67-2-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 11770#[L68]don't care [260] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 10656#[L68-1]don't care [225] L68-1-->L68-2: Formula: (= v_~k1~0_5 |v_ULTIMATE.start_main_#t~nondet10#1_4|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} OutVars{~k1~0=v_~k1~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[~k1~0] 10658#[L68-2]don't care [211] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 9850#[L69]don't care [168] L69-->L69-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 9852#[L69-1]don't care [265] L69-1-->L69-2: Formula: (= v_~k2~0_5 |v_ULTIMATE.start_main_#t~nondet11#1_4|) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} OutVars{~k2~0=v_~k2~0_5, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[~k2~0] 11044#[L69-2]don't care [232] L69-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 12026#[L72]don't care [204] L72-->L72-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (let ((.cse0 (mod v_~i1~0_7 4294967296))) (and (= .cse0 (mod v_~k2~0_6 4294967296)) (= (mod v_~k1~0_6 4294967296) .cse0) (= v_~i1~0_7 v_~i2~0_7) (= v_~i1~0_7 0))) 1 0)) InVars {~i2~0=v_~i2~0_7, ~i1~0=v_~i1~0_7, ~k1~0=v_~k1~0_6, ~k2~0=v_~k2~0_6} OutVars{~i2~0=v_~i2~0_7, ~i1~0=v_~i1~0_7, ~k1~0=v_~k1~0_6, ~k2~0=v_~k2~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 11498#[L72-1]don't care [207] L72-1-->L32: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 11500#[L32]don't care [223] L32-->L33: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 11644#[L33]don't care [174] L33-->L32-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[] 10046#[L32-1]don't care [183] L32-1-->L72-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 10048#[L72-2]don't care [164] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 10736#[L73]don't care [229] L73-->L73-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (<= 0 v_~m~0_6) 1 0)) InVars {~m~0=v_~m~0_6} OutVars{~m~0=v_~m~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 10738#[L73-1]don't care [243] L73-1-->L32-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 11740#[L32-2]don't care [236] L32-2-->L33-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 11802#[L33-3]don't care [275] L33-3-->L32-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[] 10678#[L32-3]don't care [227] L32-3-->L73-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 10680#[L73-2]don't care [181] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 11904#[L75]don't care [200] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_3| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1] 11260#[L75-1]don't care [179] L75-1-->L75-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 10944#[L75-2]don't care [251] L75-2-->L75-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_6|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 4) (select |v_#length_8| |v_ULTIMATE.start_main_~#t1~0#1.base_6|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_main_~#t1~0#1.base_6| (store (select |v_#memory_int_5| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) |v_ULTIMATE.start_main_~#t1~0#1.offset_6| |v_ULTIMATE.start_main_#t~pre12#1_4|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 1)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|} AuxVars[] AssignedVars[#memory_int] 10946#[L75-3]don't care [307] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 12350#[L75-4, L40-1]don't care [253] L75-4-->L75-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1] 12802#[L40-1, L75-5]don't care [255] L75-5-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1] 12800#[L40-1, L76]don't care [205] L76-->L76-1: Formula: (= |v_ULTIMATE.start_main_#t~pre14#1_3| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_3|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1] 12796#[L40-1, L76-1]don't care [250] L76-1-->L76-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 12794#[L40-1, L76-2]don't care [256] L76-2-->L76-3: Formula: (and (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#t2~0#1.base_7| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t2~0#1.base_7|) |v_ULTIMATE.start_main_~#t2~0#1.offset_7| |v_ULTIMATE.start_main_#t~pre14#1_4|)) |v_#memory_int_6|) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_7|) (select |v_#length_9| |v_ULTIMATE.start_main_~#t2~0#1.base_7|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_7|) (= (select |v_#valid_14| |v_ULTIMATE.start_main_~#t2~0#1.base_7|) 1)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_4|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_7|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_7|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_4|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_7|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_7|} AuxVars[] AssignedVars[#memory_int] 12792#[L40-1, L76-3]don't care [310] L76-3-->L51-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_7|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_8|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 12774#[L51-1, L40-1, L76-4]don't care [2024-02-09 23:15:01,856 INFO L750 eck$LassoCheckResult]: Loop: 12774#[L51-1, L40-1, L76-4]don't care [296] L51-1-->L52: Formula: (< v_~i2~0_2 v_~n~0_4) InVars {~n~0=v_~n~0_4, ~i2~0=v_~i2~0_2} OutVars{~n~0=v_~n~0_4, ~i2~0=v_~i2~0_2} AuxVars[] AssignedVars[] 12786#[L52, L40-1, L76-4]don't care [299] L52-->L53: Formula: (= v_~k2~0_1 (+ v_~k2~0_2 v_~m~0_3)) InVars {~k2~0=v_~k2~0_2, ~m~0=v_~m~0_3} OutVars{~k2~0=v_~k2~0_1, ~m~0=v_~m~0_3} AuxVars[] AssignedVars[~k2~0] 12782#[L40-1, L53, L76-4]don't care [301] L53-->L53-1: Formula: (= v_~i2~0_3 |v_thread2Thread1of1ForFork1_#t~post4_1|) InVars {~i2~0=v_~i2~0_3} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_1|, ~i2~0=v_~i2~0_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4] 12778#[L53-1, L40-1, L76-4]don't care [303] L53-1-->L53-2: Formula: (= v_~i2~0_4 (+ |v_thread2Thread1of1ForFork1_#t~post4_3| 1)) InVars {thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_3|} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_3|, ~i2~0=v_~i2~0_4} AuxVars[] AssignedVars[~i2~0] 12772#[L40-1, L53-2, L76-4]don't care [304] L53-2-->L51-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4] 12774#[L51-1, L40-1, L76-4]don't care [2024-02-09 23:15:01,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:15:01,857 INFO L85 PathProgramCache]: Analyzing trace with hash -704333644, now seen corresponding path program 1 times [2024-02-09 23:15:01,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:15:01,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92765550] [2024-02-09 23:15:01,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:15:01,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:15:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:15:01,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:15:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:15:01,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:15:01,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:15:01,905 INFO L85 PathProgramCache]: Analyzing trace with hash 311197834, now seen corresponding path program 1 times [2024-02-09 23:15:01,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:15:01,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015244823] [2024-02-09 23:15:01,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:15:01,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:15:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:15:01,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:15:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:15:01,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:15:01,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:15:01,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1943126089, now seen corresponding path program 1 times [2024-02-09 23:15:01,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:15:01,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923263426] [2024-02-09 23:15:01,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:15:01,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:15:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:15:01,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:15:01,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-02-09 23:15:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:15:02,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:15:02,031 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:15:02,031 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:15:02,031 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:15:02,031 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:15:02,031 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-09 23:15:02,031 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:02,031 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:15:02,031 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:15:02,031 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration3_Loop [2024-02-09 23:15:02,031 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:15:02,031 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:15:02,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:02,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:02,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:02,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:02,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:02,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:02,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:02,082 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:15:02,082 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-09 23:15:02,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:02,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:02,084 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:02,087 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:15:02,087 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:15:02,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-02-09 23:15:02,116 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:15:02,116 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_#t~post4=0} Honda state: {thread2Thread1of1ForFork1_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-09 23:15:02,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:02,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:02,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:02,124 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:02,128 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:15:02,128 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:15:02,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-02-09 23:15:02,146 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:15:02,146 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_5=-1} Honda state: {v_rep#funAddr~thread1.base_5=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-09 23:15:02,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:02,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:02,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:02,157 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:02,160 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:15:02,160 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:15:02,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-02-09 23:15:02,178 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:15:02,178 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_5=1} Honda state: {v_rep#funAddr~thread2.offset_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-09 23:15:02,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:02,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:02,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:02,185 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:02,187 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:15:02,187 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:15:02,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-02-09 23:15:02,205 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:15:02,206 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_5=-1} Honda state: {v_rep#funAddr~thread2.base_5=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-09 23:15:02,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:02,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:02,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:02,217 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:02,221 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:15:02,222 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:15:02,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-02-09 23:15:02,248 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:15:02,249 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~k2~0=0, ~m~0=0} Honda state: {~k2~0=0, ~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-09 23:15:02,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:02,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:02,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:02,255 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:02,259 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:15:02,259 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:15:02,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-02-09 23:15:02,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:02,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:02,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:02,290 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:02,299 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-09 23:15:02,299 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:15:02,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-02-09 23:15:02,399 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-09 23:15:02,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:02,403 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:15:02,403 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:15:02,403 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:15:02,403 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:15:02,403 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:15:02,403 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:02,403 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:15:02,403 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:15:02,403 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration3_Loop [2024-02-09 23:15:02,403 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:15:02,403 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:15:02,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:02,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:02,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:02,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:02,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:02,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:02,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:02,461 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:15:02,461 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:15:02,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:02,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:02,462 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:02,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-02-09 23:15:02,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:15:02,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:15:02,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:15:02,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:15:02,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:15:02,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:15:02,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:15:02,502 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:15:02,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-02-09 23:15:02,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:02,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:02,506 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:02,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-02-09 23:15:02,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:15:02,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:15:02,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:15:02,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:15:02,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:15:02,515 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:15:02,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:15:02,525 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:15:02,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:02,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:02,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:02,532 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:02,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:15:02,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:15:02,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:15:02,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:15:02,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:15:02,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:15:02,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:15:02,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:15:02,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-02-09 23:15:02,554 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:15:02,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-02-09 23:15:02,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:02,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:02,565 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:02,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:15:02,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:15:02,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:15:02,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:15:02,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:15:02,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:15:02,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:15:02,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-02-09 23:15:02,588 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:15:02,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-02-09 23:15:02,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:02,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:02,597 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:02,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:15:02,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:15:02,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:15:02,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:15:02,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:15:02,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:15:02,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:15:02,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:15:02,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-02-09 23:15:02,628 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:15:02,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-02-09 23:15:02,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:02,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:02,637 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:02,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:15:02,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-02-09 23:15:02,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:15:02,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:15:02,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:15:02,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:15:02,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:15:02,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:15:02,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:15:02,661 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:15:02,669 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-02-09 23:15:02,669 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-02-09 23:15:02,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:02,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:02,670 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:02,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-02-09 23:15:02,676 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:15:02,676 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-09 23:15:02,676 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:15:02,676 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i2~0, ~n~0) = -1*~i2~0 + 1*~n~0 Supporting invariants [] [2024-02-09 23:15:02,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-02-09 23:15:02,679 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:15:02,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:15:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:15:02,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:15:02,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:15:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:15:02,780 WARN L260 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-09 23:15:02,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:15:02,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:15:02,817 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-02-09 23:15:02,818 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2028 states and 5737 transitions. cyclomatic complexity: 3872 Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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) [2024-02-09 23:15:02,893 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2028 states and 5737 transitions. cyclomatic complexity: 3872. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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) Result 4499 states and 13833 transitions. Complement of second has 8 states. [2024-02-09 23:15:02,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-02-09 23:15:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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) [2024-02-09 23:15:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2024-02-09 23:15:02,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 175 transitions. Stem has 60 letters. Loop has 5 letters. [2024-02-09 23:15:02,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:15:02,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 175 transitions. Stem has 65 letters. Loop has 5 letters. [2024-02-09 23:15:02,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:15:02,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 175 transitions. Stem has 60 letters. Loop has 10 letters. [2024-02-09 23:15:02,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:15:02,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4499 states and 13833 transitions. [2024-02-09 23:15:02,927 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 266 [2024-02-09 23:15:02,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4499 states to 2435 states and 7376 transitions. [2024-02-09 23:15:02,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 486 [2024-02-09 23:15:02,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 585 [2024-02-09 23:15:02,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2435 states and 7376 transitions. [2024-02-09 23:15:02,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:15:02,946 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2435 states and 7376 transitions. [2024-02-09 23:15:02,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states and 7376 transitions. [2024-02-09 23:15:02,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 2336. [2024-02-09 23:15:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2336 states, 2336 states have (on average 3.0218321917808217) internal successors, (7059), 2335 states have internal predecessors, (7059), 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) [2024-02-09 23:15:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 7059 transitions. [2024-02-09 23:15:03,031 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2336 states and 7059 transitions. [2024-02-09 23:15:03,031 INFO L428 stractBuchiCegarLoop]: Abstraction has 2336 states and 7059 transitions. [2024-02-09 23:15:03,032 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-09 23:15:03,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2336 states and 7059 transitions. [2024-02-09 23:15:03,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:03,052 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 266 [2024-02-09 23:15:03,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:15:03,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:15:03,053 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:15:03,053 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:15:03,055 INFO L748 eck$LassoCheckResult]: Stem: 19898#[$Ultimate##0]don't care [180] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[] 19900#[L-1]don't care [186] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 20792#[L21]don't care [228] L21-->L21-1: Formula: (and (= (select |v_#valid_7| 1) 1) (= (select |v_#length_2| 1) 2)) InVars {#length=|v_#length_2|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] 20344#[L21-1]don't care [252] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_2| 1) 0) 48) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 19990#[L21-2]don't care [190] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_3| 1) 1) 0) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] 19992#[L21-3]don't care [218] L21-3-->L21-4: Formula: (and (= (select |v_#length_3| 2) 13) (= (select |v_#valid_8| 2) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[] 19006#[L21-4]don't care [203] L21-4-->L36: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0] 19008#[L36]don't care [259] L36-->L36-1: Formula: (= v_~m~0_4 0) InVars {} OutVars{~m~0=v_~m~0_4} AuxVars[] AssignedVars[~m~0] 19648#[L36-1]don't care [247] L36-1-->L36-2: Formula: (= v_~i1~0_5 0) InVars {} OutVars{~i1~0=v_~i1~0_5} AuxVars[] AssignedVars[~i1~0] 20310#[L36-2]don't care [235] L36-2-->L36-3: Formula: (= v_~i2~0_5 0) InVars {} OutVars{~i2~0=v_~i2~0_5} AuxVars[] AssignedVars[~i2~0] 20154#[L36-3]don't care [210] L36-3-->L37: Formula: (= v_~j1~0_6 0) InVars {} OutVars{~j1~0=v_~j1~0_6} AuxVars[] AssignedVars[~j1~0] 18916#[L37]don't care [197] L37-->L37-1: Formula: (= v_~k1~0_4 0) InVars {} OutVars{~k1~0=v_~k1~0_4} AuxVars[] AssignedVars[~k1~0] 18918#[L37-1]don't care [198] L37-1-->L-1-1: Formula: (= v_~k2~0_4 0) InVars {} OutVars{~k2~0=v_~k2~0_4} AuxVars[] AssignedVars[~k2~0] 21038#[L-1-1]don't care [261] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 21160#[L-1-2]don't care [264] L-1-2-->L60: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_4|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base] 20394#[L60]don't care [267] L60-->L60-1: Formula: (and (= (store |v_#length_5| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_4|) (= |v_#valid_9| (store |v_#valid_10| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 19960#[L60-1]don't care [184] L60-1-->L60-2: Formula: (and (= (store |v_#valid_12| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_11|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, #valid=|v_#valid_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 19848#[L60-2]don't care [175] L60-2-->L63: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 19850#[L63]don't care [159] L63-->L63-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_4| v_~n~0_6) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} OutVars{~n~0=v_~n~0_6, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[~n~0] 20856#[L63-1]don't care [246] L63-1-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 19838#[L64]don't care [171] L64-->L64-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 19840#[L64-1]don't care [263] L64-1-->L64-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet6#1_4| v_~m~0_5) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} OutVars{~m~0=v_~m~0_5, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[~m~0] 20920#[L64-2]don't care [276] L64-2-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 20922#[L65]don't care [277] L65-->L65-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 18900#[L65-1]don't care [196] L65-1-->L65-2: Formula: (= v_~i1~0_6 |v_ULTIMATE.start_main_#t~nondet7#1_4|) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|, ~i1~0=v_~i1~0_6} AuxVars[] AssignedVars[~i1~0] 18902#[L65-2]don't care [185] L65-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 18736#[L66]don't care [182] L66-->L66-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 18738#[L66-1]don't care [199] L66-1-->L66-2: Formula: (= v_~i2~0_6 |v_ULTIMATE.start_main_#t~nondet8#1_4|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|, ~i2~0=v_~i2~0_6} AuxVars[] AssignedVars[~i2~0] 18940#[L66-2]don't care [187] L66-2-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 19962#[L67]don't care [254] L67-->L67-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 20350#[L67-1]don't care [226] L67-1-->L67-2: Formula: (= v_~j1~0_7 |v_ULTIMATE.start_main_#t~nondet9#1_4|) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|, ~j1~0=v_~j1~0_7} AuxVars[] AssignedVars[~j1~0] 20758#[L67-2]don't care [167] L67-2-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 20368#[L68]don't care [260] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 19304#[L68-1]don't care [225] L68-1-->L68-2: Formula: (= v_~k1~0_5 |v_ULTIMATE.start_main_#t~nondet10#1_4|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} OutVars{~k1~0=v_~k1~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[~k1~0] 19306#[L68-2]don't care [211] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 18594#[L69]don't care [168] L69-->L69-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 18596#[L69-1]don't care [265] L69-1-->L69-2: Formula: (= v_~k2~0_5 |v_ULTIMATE.start_main_#t~nondet11#1_4|) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} OutVars{~k2~0=v_~k2~0_5, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[~k2~0] 19664#[L69-2]don't care [232] L69-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 20648#[L72]don't care [204] L72-->L72-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (let ((.cse0 (mod v_~i1~0_7 4294967296))) (and (= .cse0 (mod v_~k2~0_6 4294967296)) (= (mod v_~k1~0_6 4294967296) .cse0) (= v_~i1~0_7 v_~i2~0_7) (= v_~i1~0_7 0))) 1 0)) InVars {~i2~0=v_~i2~0_7, ~i1~0=v_~i1~0_7, ~k1~0=v_~k1~0_6, ~k2~0=v_~k2~0_6} OutVars{~i2~0=v_~i2~0_7, ~i1~0=v_~i1~0_7, ~k1~0=v_~k1~0_6, ~k2~0=v_~k2~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 20112#[L72-1]don't care [207] L72-1-->L32: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 20114#[L32]don't care [223] L32-->L33: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 20234#[L33]don't care [174] L33-->L32-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[] 18740#[L32-1]don't care [183] L32-1-->L72-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 18742#[L72-2]don't care [164] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 19386#[L73]don't care [229] L73-->L73-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (<= 0 v_~m~0_6) 1 0)) InVars {~m~0=v_~m~0_6} OutVars{~m~0=v_~m~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 19388#[L73-1]don't care [243] L73-1-->L32-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 20332#[L32-2]don't care [236] L32-2-->L33-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 20402#[L33-3]don't care [275] L33-3-->L32-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[] 19332#[L32-3]don't care [227] L32-3-->L73-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 19334#[L73-2]don't care [181] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 20514#[L75]don't care [200] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_3| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1] 19896#[L75-1]don't care [179] L75-1-->L75-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 19562#[L75-2]don't care [251] L75-2-->L75-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_6|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 4) (select |v_#length_8| |v_ULTIMATE.start_main_~#t1~0#1.base_6|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_main_~#t1~0#1.base_6| (store (select |v_#memory_int_5| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) |v_ULTIMATE.start_main_~#t1~0#1.offset_6| |v_ULTIMATE.start_main_#t~pre12#1_4|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 1)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|} AuxVars[] AssignedVars[#memory_int] 19564#[L75-3]don't care [307] L75-3-->L40-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 20704#[L75-4, L40-1]don't care [278] L40-1-->L41: Formula: (< v_~i1~0_2 v_~n~0_2) InVars {~n~0=v_~n~0_2, ~i1~0=v_~i1~0_2} OutVars{~n~0=v_~n~0_2, ~i1~0=v_~i1~0_2} AuxVars[] AssignedVars[] 20706#[L75-4, L41]don't care [281] L41-->L41-6: Formula: (= v_~j1~0_1 0) InVars {} OutVars{~j1~0=v_~j1~0_1} AuxVars[] AssignedVars[~j1~0] 21492#[L75-4, L41-6]don't care [284] L41-6-->L41-7: Formula: (<= v_~m~0_1 v_~j1~0_2) InVars {~j1~0=v_~j1~0_2, ~m~0=v_~m~0_1} OutVars{~j1~0=v_~j1~0_2, ~m~0=v_~m~0_1} AuxVars[] AssignedVars[] 20478#[L75-4, L41-7]don't care [288] L41-7-->L44: Formula: (= v_~i1~0_3 |v_thread1Thread1of1ForFork0_#t~post3_1|) InVars {~i1~0=v_~i1~0_3} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_1|, ~i1~0=v_~i1~0_3} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3] 20480#[L75-4, L44]don't care [290] L44-->L44-1: Formula: (= v_~i1~0_4 (+ |v_thread1Thread1of1ForFork0_#t~post3_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_3|} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_3|, ~i1~0=v_~i1~0_4} AuxVars[] AssignedVars[~i1~0] 20646#[L75-4, L44-1]don't care [292] L44-1-->L40-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3] 20948#[L75-4, L40-1]don't care [278] L40-1-->L41: Formula: (< v_~i1~0_2 v_~n~0_2) InVars {~n~0=v_~n~0_2, ~i1~0=v_~i1~0_2} OutVars{~n~0=v_~n~0_2, ~i1~0=v_~i1~0_2} AuxVars[] AssignedVars[] 18724#[L75-4, L41]don't care [281] L41-->L41-6: Formula: (= v_~j1~0_1 0) InVars {} OutVars{~j1~0=v_~j1~0_1} AuxVars[] AssignedVars[~j1~0] 18726#[L75-4, L41-6]don't care [2024-02-09 23:15:03,055 INFO L750 eck$LassoCheckResult]: Loop: 18726#[L75-4, L41-6]don't care [283] L41-6-->L42: Formula: (< v_~j1~0_3 v_~m~0_2) InVars {~j1~0=v_~j1~0_3, ~m~0=v_~m~0_2} OutVars{~j1~0=v_~j1~0_3, ~m~0=v_~m~0_2} AuxVars[] AssignedVars[] 19524#[L75-4, L42]don't care [287] L42-->L42-1: Formula: (= v_~k1~0_1 |v_thread1Thread1of1ForFork0_#t~post2_1|) InVars {~k1~0=v_~k1~0_1} OutVars{~k1~0=v_~k1~0_1, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2] 20566#[L75-4, L42-1]don't care [289] L42-1-->L42-2: Formula: (= v_~k1~0_2 (+ |v_thread1Thread1of1ForFork0_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_3|} OutVars{~k1~0=v_~k1~0_2, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_3|} AuxVars[] AssignedVars[~k1~0] 21148#[L75-4, L42-2]don't care [291] L42-2-->L41-3: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2] 20454#[L41-3, L75-4]don't care [293] L41-3-->L41-4: Formula: (= v_~j1~0_4 |v_thread1Thread1of1ForFork0_#t~post1_1|) InVars {~j1~0=v_~j1~0_4} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, ~j1~0=v_~j1~0_4} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 19772#[L75-4, L41-4]don't care [294] L41-4-->L41-5: Formula: (= v_~j1~0_5 (+ |v_thread1Thread1of1ForFork0_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|, ~j1~0=v_~j1~0_5} AuxVars[] AssignedVars[~j1~0] 19744#[L75-4, L41-5]don't care [295] L41-5-->L41-6: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 18726#[L75-4, L41-6]don't care [2024-02-09 23:15:03,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:15:03,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1963879451, now seen corresponding path program 2 times [2024-02-09 23:15:03,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:15:03,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966685813] [2024-02-09 23:15:03,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:15:03,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:15:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:15:03,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:15:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:15:03,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:15:03,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:15:03,081 INFO L85 PathProgramCache]: Analyzing trace with hash -594228929, now seen corresponding path program 2 times [2024-02-09 23:15:03,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:15:03,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716738470] [2024-02-09 23:15:03,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:15:03,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:15:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:15:03,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:15:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:15:03,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:15:03,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:15:03,086 INFO L85 PathProgramCache]: Analyzing trace with hash -946639899, now seen corresponding path program 1 times [2024-02-09 23:15:03,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:15:03,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652600203] [2024-02-09 23:15:03,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:15:03,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:15:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:15:03,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:15:03,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-09 23:15:03,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652600203] [2024-02-09 23:15:03,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652600203] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-09 23:15:03,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-09 23:15:03,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-09 23:15:03,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76876947] [2024-02-09 23:15:03,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-09 23:15:03,211 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:15:03,211 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:15:03,211 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:15:03,211 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:15:03,211 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-09 23:15:03,211 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:03,211 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:15:03,211 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:15:03,211 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration4_Loop [2024-02-09 23:15:03,211 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:15:03,211 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:15:03,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:03,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:03,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:03,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:03,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:03,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:03,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:03,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:03,266 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:15:03,266 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-09 23:15:03,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:03,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:03,268 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:03,271 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:15:03,271 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:15:03,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-02-09 23:15:03,288 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:15:03,288 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_#t~post2=0} Honda state: {thread1Thread1of1ForFork0_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-09 23:15:03,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:03,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:03,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:03,292 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:03,313 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:15:03,313 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:15:03,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-02-09 23:15:03,330 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:15:03,330 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_7=-1} Honda state: {v_rep#funAddr~thread1.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-09 23:15:03,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-02-09 23:15:03,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:03,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:03,334 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:03,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-02-09 23:15:03,336 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:15:03,336 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:15:03,347 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:15:03,348 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_7=-1} Honda state: {v_rep#funAddr~thread2.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-09 23:15:03,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:03,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:03,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:03,354 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:03,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-02-09 23:15:03,356 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:15:03,356 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:15:03,371 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:15:03,371 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_7=0} Honda state: {v_rep#funAddr~thread1.offset_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-09 23:15:03,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-02-09 23:15:03,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:03,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:03,375 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:03,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-02-09 23:15:03,377 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:15:03,377 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:15:03,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-02-09 23:15:03,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:03,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:03,387 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:03,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-02-09 23:15:03,391 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-09 23:15:03,391 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:15:03,484 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-09 23:15:03,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-02-09 23:15:03,488 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:15:03,488 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:15:03,488 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:15:03,488 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:15:03,488 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:15:03,488 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:03,488 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:15:03,488 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:15:03,488 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_BEv2_Iteration4_Loop [2024-02-09 23:15:03,488 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:15:03,488 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:15:03,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:03,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:03,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:03,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:03,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:03,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:03,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:03,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:15:03,590 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:15:03,590 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:15:03,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:03,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:03,591 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:03,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:15:03,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:15:03,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:15:03,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:15:03,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:15:03,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:15:03,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:15:03,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-02-09 23:15:03,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:15:03,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:03,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:03,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:03,617 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:03,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:15:03,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-02-09 23:15:03,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:15:03,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:15:03,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:15:03,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:15:03,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:15:03,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:15:03,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:15:03,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:03,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:03,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:03,661 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:03,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:15:03,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:15:03,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:15:03,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:15:03,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:15:03,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:15:03,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:15:03,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-02-09 23:15:03,688 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:15:03,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-02-09 23:15:03,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:03,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:03,691 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:03,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-02-09 23:15:03,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:15:03,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:15:03,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:15:03,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:15:03,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:15:03,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:15:03,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:15:03,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:15:03,702 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:15:03,705 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-09 23:15:03,705 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-09 23:15:03,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:15:03,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:15:03,707 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:15:03,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-02-09 23:15:03,709 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:15:03,709 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-09 23:15:03,709 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:15:03,709 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~j1~0, ~m~0) = -1*~j1~0 + 1*~m~0 Supporting invariants [] [2024-02-09 23:15:03,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-02-09 23:15:03,712 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:15:03,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:15:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:15:03,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:15:03,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:15:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:15:03,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-09 23:15:03,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:15:03,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:15:03,855 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-02-09 23:15:03,855 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2336 states and 7059 transitions. cyclomatic complexity: 4877 Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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) [2024-02-09 23:15:03,922 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2336 states and 7059 transitions. cyclomatic complexity: 4877. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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) Result 4168 states and 12963 transitions. Complement of second has 9 states. [2024-02-09 23:15:03,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-02-09 23:15:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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) [2024-02-09 23:15:03,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-02-09 23:15:03,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 156 transitions. Stem has 62 letters. Loop has 7 letters. [2024-02-09 23:15:03,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:15:03,924 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:15:03,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:15:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:15:03,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:15:03,954 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:15:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:15:04,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-09 23:15:04,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:15:04,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:15:04,044 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2024-02-09 23:15:04,044 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2336 states and 7059 transitions. cyclomatic complexity: 4877 Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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) [2024-02-09 23:15:04,134 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2336 states and 7059 transitions. cyclomatic complexity: 4877. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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) Result 4330 states and 13357 transitions. Complement of second has 11 states. [2024-02-09 23:15:04,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-02-09 23:15:04,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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) [2024-02-09 23:15:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 172 transitions. [2024-02-09 23:15:04,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 172 transitions. Stem has 62 letters. Loop has 7 letters. [2024-02-09 23:15:04,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:15:04,136 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-09 23:15:04,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:15:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:15:04,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:15:04,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:15:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:15:04,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-09 23:15:04,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:15:04,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:15:04,241 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-02-09 23:15:04,241 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2336 states and 7059 transitions. cyclomatic complexity: 4877 Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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) [2024-02-09 23:15:04,336 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2336 states and 7059 transitions. cyclomatic complexity: 4877. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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) Result 5072 states and 16121 transitions. Complement of second has 8 states. [2024-02-09 23:15:04,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-02-09 23:15:04,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-02-09 23:15:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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) [2024-02-09 23:15:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2024-02-09 23:15:04,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 168 transitions. Stem has 62 letters. Loop has 7 letters. [2024-02-09 23:15:04,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:15:04,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 168 transitions. Stem has 69 letters. Loop has 7 letters. [2024-02-09 23:15:04,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:15:04,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 168 transitions. Stem has 62 letters. Loop has 14 letters. [2024-02-09 23:15:04,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:15:04,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5072 states and 16121 transitions. [2024-02-09 23:15:04,376 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-09 23:15:04,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5072 states to 0 states and 0 transitions. [2024-02-09 23:15:04,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-02-09 23:15:04,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-02-09 23:15:04,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-02-09 23:15:04,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-02-09 23:15:04,377 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-02-09 23:15:04,377 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-02-09 23:15:04,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-09 23:15:04,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-09 23:15:04,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-09 23:15:04,381 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-02-09 23:15:04,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-02-09 23:15:04,382 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2024-02-09 23:15:04,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2024-02-09 23:15:04,382 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-09 23:15:04,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2024-02-09 23:15:04,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-02-09 23:15:04,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-02-09 23:15:04,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-02-09 23:15:04,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-02-09 23:15:04,383 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-02-09 23:15:04,383 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-02-09 23:15:04,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-09 23:15:04,384 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-02-09 23:15:04,384 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-02-09 23:15:04,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-02-09 23:15:04,384 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-09 23:15:04,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-02-09 23:15:04,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:15:04 BoogieIcfgContainer [2024-02-09 23:15:04,390 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:15:04,392 INFO L158 Benchmark]: Toolchain (without parser) took 6514.39ms. Allocated memory was 180.4MB in the beginning and 315.6MB in the end (delta: 135.3MB). Free memory was 118.9MB in the beginning and 229.1MB in the end (delta: -110.2MB). Peak memory consumption was 24.2MB. Max. memory is 8.0GB. [2024-02-09 23:15:04,393 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 180.4MB. Free memory was 155.7MB in the beginning and 155.6MB in the end (delta: 85.1kB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:15:04,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.92ms. Allocated memory is still 180.4MB. Free memory was 118.8MB in the beginning and 149.9MB in the end (delta: -31.1MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2024-02-09 23:15:04,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.57ms. Allocated memory is still 180.4MB. Free memory was 149.9MB in the beginning and 148.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-09 23:15:04,393 INFO L158 Benchmark]: Boogie Preprocessor took 19.39ms. Allocated memory is still 180.4MB. Free memory was 148.5MB in the beginning and 146.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-09 23:15:04,393 INFO L158 Benchmark]: RCFGBuilder took 306.56ms. Allocated memory is still 180.4MB. Free memory was 146.8MB in the beginning and 132.7MB in the end (delta: 14.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-02-09 23:15:04,394 INFO L158 Benchmark]: BuchiAutomizer took 5933.22ms. Allocated memory was 180.4MB in the beginning and 315.6MB in the end (delta: 135.3MB). Free memory was 132.7MB in the beginning and 229.1MB in the end (delta: -96.4MB). Peak memory consumption was 38.6MB. Max. memory is 8.0GB. [2024-02-09 23:15:04,394 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.10ms. Allocated memory is still 180.4MB. Free memory was 155.7MB in the beginning and 155.6MB in the end (delta: 85.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 211.92ms. Allocated memory is still 180.4MB. Free memory was 118.8MB in the beginning and 149.9MB in the end (delta: -31.1MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.57ms. Allocated memory is still 180.4MB. Free memory was 149.9MB in the beginning and 148.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.39ms. Allocated memory is still 180.4MB. Free memory was 148.5MB in the beginning and 146.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 306.56ms. Allocated memory is still 180.4MB. Free memory was 146.8MB in the beginning and 132.7MB in the end (delta: 14.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 5933.22ms. Allocated memory was 180.4MB in the beginning and 315.6MB in the end (delta: 135.3MB). Free memory was 132.7MB in the beginning and 229.1MB in the end (delta: -96.4MB). Peak memory consumption was 38.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function ((-1 * i1) + n) and consists of 6 locations. One deterministic module has affine ranking function ((-1 * j1) + m) and consists of 5 locations. One deterministic module has affine ranking function ((-1 * i2) + n) and consists of 5 locations. One nondeterministic module has affine ranking function ((-1 * j1) + m) and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.8s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 853 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 887 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 881 mSDsluCounter, 1530 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 739 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 229 IncrementalHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 791 mSDtfsCounter, 229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax285 hnf100 lsp24 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 64ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 15 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s InitialAbstractionConstructionTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-02-09 23:15:04,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...