/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.fairness.type.for.concurrent.programs NONE -i ../../../trunk/examples/svcomp/weaver/parallel-misc-2-unrolled-atomic.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-42053ae-m [2023-09-08 14:29:54,867 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-09-08 14:29:54,932 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-09-08 14:29:54,960 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-08 14:29:54,960 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-08 14:29:54,961 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-08 14:29:54,962 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-08 14:29:54,962 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-09-08 14:29:54,962 INFO L137 SettingsManager]: * Use SBE=true [2023-09-08 14:29:54,963 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-09-08 14:29:54,963 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-09-08 14:29:54,963 INFO L137 SettingsManager]: * Use old map elimination=false [2023-09-08 14:29:54,964 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-09-08 14:29:54,964 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-09-08 14:29:54,964 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-09-08 14:29:54,965 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-08 14:29:54,965 INFO L137 SettingsManager]: * sizeof long=4 [2023-09-08 14:29:54,965 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-08 14:29:54,966 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-08 14:29:54,966 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-09-08 14:29:54,966 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-09-08 14:29:54,970 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-09-08 14:29:54,970 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-09-08 14:29:54,970 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-09-08 14:29:54,971 INFO L137 SettingsManager]: * sizeof long double=12 [2023-09-08 14:29:54,971 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-09-08 14:29:54,972 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-09-08 14:29:54,972 INFO L137 SettingsManager]: * Use constant arrays=true [2023-09-08 14:29:54,972 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-09-08 14:29:54,977 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-08 14:29:54,977 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-08 14:29:54,978 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-08 14:29:54,978 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-08 14:29:54,978 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-08 14:29:54,979 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-09-08 14:29:54,979 INFO L137 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: Fairness type for concurrent programs -> NONE [2023-09-08 14:29:55,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-08 14:29:55,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-08 14:29:55,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-08 14:29:55,234 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-08 14:29:55,234 INFO L274 PluginConnector]: CDTParser initialized [2023-09-08 14:29:55,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2-unrolled-atomic.wvr.c [2023-09-08 14:29:56,452 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-08 14:29:56,665 INFO L384 CDTParser]: Found 1 translation units. [2023-09-08 14:29:56,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2-unrolled-atomic.wvr.c [2023-09-08 14:29:56,672 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41983367e/e195a03a43084b3587b209ef69fcc962/FLAGa28164f1b [2023-09-08 14:29:56,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41983367e/e195a03a43084b3587b209ef69fcc962 [2023-09-08 14:29:56,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-08 14:29:56,688 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-08 14:29:56,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-08 14:29:56,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-08 14:29:56,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-08 14:29:56,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:29:56" (1/1) ... [2023-09-08 14:29:56,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66f9c189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:56, skipping insertion in model container [2023-09-08 14:29:56,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:29:56" (1/1) ... [2023-09-08 14:29:56,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-08 14:29:56,713 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-08 14:29:56,837 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2-unrolled-atomic.wvr.c[2252,2265] [2023-09-08 14:29:56,838 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 14:29:56,847 INFO L203 MainTranslator]: Completed pre-run [2023-09-08 14:29:56,868 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2-unrolled-atomic.wvr.c[2252,2265] [2023-09-08 14:29:56,869 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 14:29:56,874 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-08 14:29:56,875 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-08 14:29:56,879 INFO L208 MainTranslator]: Completed translation [2023-09-08 14:29:56,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:56 WrapperNode [2023-09-08 14:29:56,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-08 14:29:56,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-08 14:29:56,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-08 14:29:56,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-08 14:29:56,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:56" (1/1) ... [2023-09-08 14:29:56,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:56" (1/1) ... [2023-09-08 14:29:56,908 INFO L138 Inliner]: procedures = 20, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 68 [2023-09-08 14:29:56,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-08 14:29:56,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-08 14:29:56,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-08 14:29:56,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-08 14:29:56,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:56" (1/1) ... [2023-09-08 14:29:56,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:56" (1/1) ... [2023-09-08 14:29:56,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:56" (1/1) ... [2023-09-08 14:29:56,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:56" (1/1) ... [2023-09-08 14:29:56,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:56" (1/1) ... [2023-09-08 14:29:56,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:56" (1/1) ... [2023-09-08 14:29:56,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:56" (1/1) ... [2023-09-08 14:29:56,936 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:56" (1/1) ... [2023-09-08 14:29:56,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-08 14:29:56,939 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-08 14:29:56,939 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-08 14:29:56,939 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-08 14:29:56,940 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:56" (1/1) ... [2023-09-08 14:29:56,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:29:56,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:29:56,982 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) [2023-09-08 14:29:57,008 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 [2023-09-08 14:29:57,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-08 14:29:57,034 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-08 14:29:57,035 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-08 14:29:57,035 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-08 14:29:57,035 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-08 14:29:57,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-08 14:29:57,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-08 14:29:57,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-08 14:29:57,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-08 14:29:57,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-08 14:29:57,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-08 14:29:57,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-08 14:29:57,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-08 14:29:57,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-08 14:29:57,038 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-08 14:29:57,151 INFO L236 CfgBuilder]: Building ICFG [2023-09-08 14:29:57,153 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-08 14:29:57,394 INFO L277 CfgBuilder]: Performing block encoding [2023-09-08 14:29:57,435 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-08 14:29:57,435 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-08 14:29:57,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:29:57 BoogieIcfgContainer [2023-09-08 14:29:57,438 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-08 14:29:57,439 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-09-08 14:29:57,439 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-09-08 14:29:57,442 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-09-08 14:29:57,442 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-08 14:29:57,443 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.09 02:29:56" (1/3) ... [2023-09-08 14:29:57,443 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@413fd93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.09 02:29:57, skipping insertion in model container [2023-09-08 14:29:57,444 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-08 14:29:57,444 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:29:56" (2/3) ... [2023-09-08 14:29:57,444 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@413fd93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.09 02:29:57, skipping insertion in model container [2023-09-08 14:29:57,444 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-08 14:29:57,444 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:29:57" (3/3) ... [2023-09-08 14:29:57,445 INFO L332 chiAutomizerObserver]: Analyzing ICFG parallel-misc-2-unrolled-atomic.wvr.c [2023-09-08 14:29:57,514 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-08 14:29:57,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 87 transitions, 190 flow [2023-09-08 14:29:57,570 INFO L124 PetriNetUnfolderBase]: 7/83 cut-off events. [2023-09-08 14:29:57,570 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-09-08 14:29:57,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 83 events. 7/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2023-09-08 14:29:57,574 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 87 transitions, 190 flow [2023-09-08 14:29:57,580 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 83 transitions, 178 flow [2023-09-08 14:29:57,591 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-09-08 14:29:57,591 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-09-08 14:29:57,591 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-09-08 14:29:57,591 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-09-08 14:29:57,591 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-09-08 14:29:57,591 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-09-08 14:29:57,591 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-09-08 14:29:57,592 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-09-08 14:29:57,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-09-08 14:29:57,660 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 82 [2023-09-08 14:29:57,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-08 14:29:57,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-08 14:29:57,666 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] [2023-09-08 14:29:57,666 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-09-08 14:29:57,667 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-09-08 14:29:57,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 200 states, but on-demand construction may add more states [2023-09-08 14:29:57,681 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 82 [2023-09-08 14:29:57,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-08 14:29:57,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-08 14:29:57,683 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] [2023-09-08 14:29:57,683 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-09-08 14:29:57,689 INFO L748 eck$LassoCheckResult]: Stem: 88#[$Ultimate##0]don't care [180] $Ultimate##0-->L-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 91#[L-1]don't care [186] L-1-->L-1-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 93#[L-1-1]don't care [210] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 95#[L21]don't care [179] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 97#[L21-1]don't care [200] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 99#[L21-2]don't care [196] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 101#[L21-3]don't care [164] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 38 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 103#[L21-4]don't care [225] L21-4-->L37: Formula: (= v_~pos~0_9 0) InVars {} OutVars{~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~pos~0] 105#[L37]don't care [208] L37-->L37-1: Formula: (= v_~i1~0_7 0) InVars {} OutVars{~i1~0=v_~i1~0_7} AuxVars[] AssignedVars[~i1~0] 107#[L37-1]don't care [209] L37-1-->L37-2: Formula: (= v_~i2~0_7 0) InVars {} OutVars{~i2~0=v_~i2~0_7} AuxVars[] AssignedVars[~i2~0] 109#[L37-2]don't care [165] L37-2-->L-1-2: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 111#[L-1-2]don't care [213] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 113#[L-1-3]don't care [223] L-1-3-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base] 115#[L66]don't care [184] L66-->L66-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 117#[L66-1]don't care [214] L66-1-->L66-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 119#[L66-2]don't care [190] L66-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 121#[L69]don't care [159] L69-->L69-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_3| v_~pos~0_10) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|, ~pos~0=v_~pos~0_10} AuxVars[] AssignedVars[~pos~0] 123#[L69-1]don't care [215] L69-1-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 125#[L70]don't care [228] L70-->L70-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 127#[L70-1]don't care [175] L70-1-->L70-2: Formula: (= v_~i1~0_8 |v_ULTIMATE.start_main_#t~nondet8#1_3|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|, ~i1~0=v_~i1~0_8} AuxVars[] AssignedVars[~i1~0] 129#[L70-2]don't care [174] L70-2-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 131#[L71]don't care [155] L71-->L71-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 133#[L71-1]don't care [168] L71-1-->L71-2: Formula: (= v_~i2~0_8 |v_ULTIMATE.start_main_#t~nondet9#1_3|) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ~i2~0=v_~i2~0_8} AuxVars[] AssignedVars[~i2~0] 135#[L71-2]don't care [211] L71-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 137#[L72]don't care [227] L72-->L72-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 139#[L72-1]don't care [149] L72-1-->L72-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 141#[L72-2]don't care [156] L72-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 143#[L75]don't care [220] L75-->L75-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (= v_~i1~0_9 v_~pos~0_11) (= v_~i2~0_9 v_~pos~0_11) (= v_~pos~0_11 0)) 1 0)) InVars {~i2~0=v_~i2~0_9, ~pos~0=v_~pos~0_11, ~i1~0=v_~i1~0_9} OutVars{~i2~0=v_~i2~0_9, ~pos~0=v_~pos~0_11, ~i1~0=v_~i1~0_9, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 145#[L75-1]don't care [178] L75-1-->L33: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 147#[L33]don't care [169] L33-->L34: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 149#[L34]don't care [177] L34-->L33-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 153#[L33-1]don't care [206] L33-1-->L76: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (and (<= 0 v_~N~0_7) (<= v_~N~0_7 1073741823)) 1 0)) InVars {~N~0=v_~N~0_7} OutVars{~N~0=v_~N~0_7, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 155#[L76]don't care [229] L76-->L33-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 157#[L33-2]don't care [170] L33-2-->L34-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_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_~cond#1] 159#[L34-3]don't care [162] L34-3-->L33-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 163#[L33-3]don't care [226] L33-3-->L78: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 165#[L78]don't care [167] L78-->L78-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 167#[L78-1]don't care [171] L78-1-->L78-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre11#1_3|)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 169#[L78-2]don't care [246] L78-2-->L46: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_4|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_4|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_4|, thread1Thread1of1ForFork0_#t~post4=|v_thread1Thread1of1ForFork0_#t~post4_4|, 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_#t~post4, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 171#[L78-3, L46]don't care [2023-09-08 14:29:57,690 INFO L750 eck$LassoCheckResult]: Loop: 171#[L78-3, L46]don't care [232] L46-->L41: Formula: (< v_~i1~0_2 (* 2 v_~N~0_2)) InVars {~i1~0=v_~i1~0_2, ~N~0=v_~N~0_2} OutVars{~i1~0=v_~i1~0_2, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] 175#[L41, L78-3]don't care [235] L41-->L46: Formula: (and (= v_~pos~0_54 v_~pos~0_53) (= v_~i1~0_34 (+ v_~i1~0_36 2))) InVars {~i1~0=v_~i1~0_36, ~pos~0=v_~pos~0_54} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_1|, thread1Thread1of1ForFork0_#t~post4=|v_thread1Thread1of1ForFork0_#t~post4_1|, ~i1~0=v_~i1~0_34, ~pos~0=v_~pos~0_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_#t~post4, ~i1~0, ~pos~0] 171#[L78-3, L46]don't care [2023-09-08 14:29:57,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:29:57,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1462599993, now seen corresponding path program 1 times [2023-09-08 14:29:57,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:29:57,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294044308] [2023-09-08 14:29:57,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:29:57,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:29:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:29:57,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:29:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:29:57,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:29:57,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:29:57,961 INFO L85 PathProgramCache]: Analyzing trace with hash 8388, now seen corresponding path program 1 times [2023-09-08 14:29:57,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:29:57,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075957803] [2023-09-08 14:29:57,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:29:57,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:29:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:29:57,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:29:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:29:57,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:29:57,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:29:57,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1104294908, now seen corresponding path program 1 times [2023-09-08 14:29:57,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:29:57,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462464465] [2023-09-08 14:29:57,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:29:57,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:29:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:29:58,042 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:29:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:29:58,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:29:58,138 INFO L210 LassoAnalysis]: Preferences: [2023-09-08 14:29:58,139 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-08 14:29:58,139 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-08 14:29:58,139 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-08 14:29:58,139 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-09-08 14:29:58,139 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:29:58,139 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-08 14:29:58,139 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-08 14:29:58,140 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-misc-2-unrolled-atomic.wvr.c_BEv2_Iteration1_Loop [2023-09-08 14:29:58,140 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-08 14:29:58,140 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-08 14:29:58,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:58,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:58,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:58,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:58,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:58,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:58,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:58,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:58,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:58,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:58,266 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-08 14:29:58,267 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-09-08 14:29:58,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:29:58,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:29:58,277 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) [2023-09-08 14:29:58,281 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-09-08 14:29:58,281 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-09-08 14:29:58,290 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 [2023-09-08 14:29:58,312 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 [2023-09-08 14:29:58,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:29:58,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:29:58,317 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) [2023-09-08 14:29:58,320 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 [2023-09-08 14:29:58,321 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-09-08 14:29:58,321 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-09-08 14:29:58,405 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-09-08 14:29:58,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-09-08 14:29:58,409 INFO L210 LassoAnalysis]: Preferences: [2023-09-08 14:29:58,409 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-08 14:29:58,409 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-08 14:29:58,409 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-08 14:29:58,409 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-09-08 14:29:58,409 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:29:58,409 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-08 14:29:58,409 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-08 14:29:58,410 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-misc-2-unrolled-atomic.wvr.c_BEv2_Iteration1_Loop [2023-09-08 14:29:58,410 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-08 14:29:58,410 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-08 14:29:58,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:58,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:58,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:58,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:58,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:58,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:58,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:58,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:58,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:58,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:58,555 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-08 14:29:58,559 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-09-08 14:29:58,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:29:58,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:29:58,565 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) [2023-09-08 14:29:58,568 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 [2023-09-08 14:29:58,570 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 [2023-09-08 14:29:58,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:29:58,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-08 14:29:58,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:29:58,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:29:58,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:29:58,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-08 14:29:58,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-08 14:29:58,597 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-09-08 14:29:58,602 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-09-08 14:29:58,602 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-09-08 14:29:58,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:29:58,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:29:58,651 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) [2023-09-08 14:29:58,653 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 [2023-09-08 14:29:58,656 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-09-08 14:29:58,657 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-09-08 14:29:58,657 INFO L513 LassoAnalysis]: Proved termination. [2023-09-08 14:29:58,658 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i1~0, ~N~0) = -1*~i1~0 + 2*~N~0 Supporting invariants [] [2023-09-08 14:29:58,667 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 [2023-09-08 14:29:58,670 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-09-08 14:29:58,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:29:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 14:29:58,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2023-09-08 14:29:58,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 14:29:58,813 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 [2023-09-08 14:29:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 14:29:58,857 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-08 14:29:58,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 14:29:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 14:29:58,906 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-09-08 14:29:58,909 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 200 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 14:29:59,043 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 200 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 614 states and 1661 transitions. Complement of second has 7 states. [2023-09-08 14:29:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-09-08 14:29:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 14:29:59,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2023-09-08 14:29:59,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 159 transitions. Stem has 39 letters. Loop has 2 letters. [2023-09-08 14:29:59,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-08 14:29:59,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 159 transitions. Stem has 41 letters. Loop has 2 letters. [2023-09-08 14:29:59,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-08 14:29:59,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 159 transitions. Stem has 39 letters. Loop has 4 letters. [2023-09-08 14:29:59,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-08 14:29:59,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 614 states and 1661 transitions. [2023-09-08 14:29:59,071 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 46 [2023-09-08 14:29:59,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 614 states to 194 states and 450 transitions. [2023-09-08 14:29:59,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2023-09-08 14:29:59,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2023-09-08 14:29:59,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 450 transitions. [2023-09-08 14:29:59,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-09-08 14:29:59,081 INFO L218 hiAutomatonCegarLoop]: Abstraction has 194 states and 450 transitions. [2023-09-08 14:29:59,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 450 transitions. [2023-09-08 14:29:59,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 156. [2023-09-08 14:29:59,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 156 states have (on average 2.2884615384615383) internal successors, (357), 155 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 14:29:59,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 357 transitions. [2023-09-08 14:29:59,114 INFO L240 hiAutomatonCegarLoop]: Abstraction has 156 states and 357 transitions. [2023-09-08 14:29:59,114 INFO L428 stractBuchiCegarLoop]: Abstraction has 156 states and 357 transitions. [2023-09-08 14:29:59,114 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-09-08 14:29:59,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 357 transitions. [2023-09-08 14:29:59,115 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 46 [2023-09-08 14:29:59,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-08 14:29:59,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-08 14:29:59,117 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] [2023-09-08 14:29:59,117 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-09-08 14:29:59,118 INFO L748 eck$LassoCheckResult]: Stem: 1407#[$Ultimate##0]don't care [180] $Ultimate##0-->L-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 1409#[L-1]don't care [186] L-1-->L-1-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 1429#[L-1-1]don't care [210] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 1543#[L21]don't care [179] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 1545#[L21-1]don't care [200] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 1445#[L21-2]don't care [196] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 1447#[L21-3]don't care [164] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 38 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 1497#[L21-4]don't care [225] L21-4-->L37: Formula: (= v_~pos~0_9 0) InVars {} OutVars{~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~pos~0] 1479#[L37]don't care [208] L37-->L37-1: Formula: (= v_~i1~0_7 0) InVars {} OutVars{~i1~0=v_~i1~0_7} AuxVars[] AssignedVars[~i1~0] 1481#[L37-1]don't care [209] L37-1-->L37-2: Formula: (= v_~i2~0_7 0) InVars {} OutVars{~i2~0=v_~i2~0_7} AuxVars[] AssignedVars[~i2~0] 1313#[L37-2]don't care [165] L37-2-->L-1-2: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 1315#[L-1-2]don't care [213] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 1559#[L-1-3]don't care [223] L-1-3-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base] 1419#[L66]don't care [184] L66-->L66-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 1421#[L66-1]don't care [214] L66-1-->L66-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 1431#[L66-2]don't care [190] L66-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 1309#[L69]don't care [159] L69-->L69-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_3| v_~pos~0_10) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|, ~pos~0=v_~pos~0_10} AuxVars[] AssignedVars[~pos~0] 1311#[L69-1]don't care [215] L69-1-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 1509#[L70]don't care [228] L70-->L70-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 1403#[L70-1]don't care [175] L70-1-->L70-2: Formula: (= v_~i1~0_8 |v_ULTIMATE.start_main_#t~nondet8#1_3|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|, ~i1~0=v_~i1~0_8} AuxVars[] AssignedVars[~i1~0] 1391#[L70-2]don't care [174] L70-2-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 1393#[L71]don't care [155] L71-->L71-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 1353#[L71-1]don't care [168] L71-1-->L71-2: Formula: (= v_~i2~0_8 |v_ULTIMATE.start_main_#t~nondet9#1_3|) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ~i2~0=v_~i2~0_8} AuxVars[] AssignedVars[~i2~0] 1355#[L71-2]don't care [211] L71-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 1503#[L72]don't care [227] L72-->L72-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 1505#[L72-1]don't care [149] L72-1-->L72-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 1275#[L72-2]don't care [156] L72-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 1277#[L75]don't care [220] L75-->L75-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (= v_~i1~0_9 v_~pos~0_11) (= v_~i2~0_9 v_~pos~0_11) (= v_~pos~0_11 0)) 1 0)) InVars {~i2~0=v_~i2~0_9, ~pos~0=v_~pos~0_11, ~i1~0=v_~i1~0_9} OutVars{~i2~0=v_~i2~0_9, ~pos~0=v_~pos~0_11, ~i1~0=v_~i1~0_9, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1405#[L75-1]don't care [178] L75-1-->L33: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 1357#[L33]don't care [169] L33-->L34: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 1359#[L34]don't care [177] L34-->L33-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 1401#[L33-1]don't care [206] L33-1-->L76: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (and (<= 0 v_~N~0_7) (<= v_~N~0_7 1073741823)) 1 0)) InVars {~N~0=v_~N~0_7} OutVars{~N~0=v_~N~0_7, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1477#[L76]don't care [229] L76-->L33-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 1507#[L33-2]don't care [170] L33-2-->L34-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_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_~cond#1] 1533#[L34-3]don't care [162] L34-3-->L33-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 1535#[L33-3]don't care [226] L33-3-->L78: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 1349#[L78]don't care [167] L78-->L78-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 1351#[L78-1]don't care [171] L78-1-->L78-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre11#1_3|)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 1435#[L78-2]don't care [246] L78-2-->L46: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_4|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_4|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_4|, thread1Thread1of1ForFork0_#t~post4=|v_thread1Thread1of1ForFork0_#t~post4_4|, 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_#t~post4, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 1377#[L78-3, L46]don't care [152] L78-3-->L78-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 1381#[L46, L78-4]don't care [187] L78-4-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1] 1251#[L46, L79]don't care [205] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] 1257#[L79-1, L46]don't care [197] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 1335#[L79-2, L46]don't care [185] L79-2-->L79-3: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_3|)) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre13#1_3|)) |v_#memory_int_5|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_6|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 1339#[L46, L79-3]don't care [249] L79-3-->L59: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post5=|v_thread2Thread1of1ForFork1_#t~post5_4|, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_#t~post6=|v_thread2Thread1of1ForFork1_#t~post6_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5, thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_#t~post6, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1517#[L46, L79-4, L59]don't care [2023-09-08 14:29:59,118 INFO L750 eck$LassoCheckResult]: Loop: 1517#[L46, L79-4, L59]don't care [238] L59-->L54: Formula: (< v_~i2~0_1 (* 2 v_~N~0_3)) InVars {~i2~0=v_~i2~0_1, ~N~0=v_~N~0_3} OutVars{~i2~0=v_~i2~0_1, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[] 1515#[L46, L79-4, L54]don't care [241] L54-->L59: Formula: (and (= v_~pos~0_45 v_~pos~0_43) (= v_~i2~0_34 (+ v_~i2~0_35 2))) InVars {~i2~0=v_~i2~0_35, ~pos~0=v_~pos~0_45} OutVars{thread2Thread1of1ForFork1_#t~post5=|v_thread2Thread1of1ForFork1_#t~post5_1|, ~i2~0=v_~i2~0_34, ~pos~0=v_~pos~0_43, thread2Thread1of1ForFork1_#t~post6=|v_thread2Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5, thread2Thread1of1ForFork1_#t~post6, ~i2~0, ~pos~0] 1517#[L46, L79-4, L59]don't care [2023-09-08 14:29:59,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:29:59,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1519904532, now seen corresponding path program 1 times [2023-09-08 14:29:59,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:29:59,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078956383] [2023-09-08 14:29:59,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:29:59,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:29:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:29:59,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:29:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:29:59,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:29:59,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:29:59,167 INFO L85 PathProgramCache]: Analyzing trace with hash 8580, now seen corresponding path program 1 times [2023-09-08 14:29:59,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:29:59,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22831482] [2023-09-08 14:29:59,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:29:59,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:29:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:29:59,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:29:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:29:59,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:29:59,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:29:59,174 INFO L85 PathProgramCache]: Analyzing trace with hash 339382231, now seen corresponding path program 1 times [2023-09-08 14:29:59,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:29:59,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228691344] [2023-09-08 14:29:59,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:29:59,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:29:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:29:59,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:29:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:29:59,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:29:59,236 INFO L210 LassoAnalysis]: Preferences: [2023-09-08 14:29:59,236 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-08 14:29:59,236 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-08 14:29:59,237 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-08 14:29:59,237 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-09-08 14:29:59,237 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:29:59,237 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-08 14:29:59,237 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-08 14:29:59,237 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-misc-2-unrolled-atomic.wvr.c_BEv2_Iteration2_Loop [2023-09-08 14:29:59,237 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-08 14:29:59,237 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-08 14:29:59,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:59,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:59,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:59,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:59,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:59,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:59,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:59,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:59,329 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-08 14:29:59,330 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-09-08 14:29:59,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:29:59,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:29:59,333 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) [2023-09-08 14:29:59,336 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 [2023-09-08 14:29:59,337 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-09-08 14:29:59,337 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-09-08 14:29:59,359 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-09-08 14:29:59,359 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_#t~post5=0} Honda state: {thread2Thread1of1ForFork1_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-09-08 14:29:59,364 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 [2023-09-08 14:29:59,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:29:59,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:29:59,366 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) [2023-09-08 14:29:59,367 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 [2023-09-08 14:29:59,369 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-09-08 14:29:59,369 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-09-08 14:29:59,381 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-09-08 14:29:59,381 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: [] [2023-09-08 14:29:59,388 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 [2023-09-08 14:29:59,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:29:59,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:29:59,391 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) [2023-09-08 14:29:59,392 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 [2023-09-08 14:29:59,394 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-09-08 14:29:59,394 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-09-08 14:29:59,406 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-09-08 14:29:59,406 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_3=-1} Honda state: {v_rep#funAddr~thread1.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-09-08 14:29:59,420 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 [2023-09-08 14:29:59,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:29:59,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:29:59,422 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) [2023-09-08 14:29:59,425 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 [2023-09-08 14:29:59,426 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-09-08 14:29:59,426 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-09-08 14:29:59,456 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-09-08 14:29:59,456 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_3=-1} Honda state: {v_rep#funAddr~thread2.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-09-08 14:29:59,459 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 [2023-09-08 14:29:59,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:29:59,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:29:59,461 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) [2023-09-08 14:29:59,462 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 [2023-09-08 14:29:59,464 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-09-08 14:29:59,464 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-09-08 14:29:59,478 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 [2023-09-08 14:29:59,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:29:59,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:29:59,479 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) [2023-09-08 14:29:59,481 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 [2023-09-08 14:29:59,483 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-09-08 14:29:59,483 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-09-08 14:29:59,599 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-09-08 14:29:59,603 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 [2023-09-08 14:29:59,603 INFO L210 LassoAnalysis]: Preferences: [2023-09-08 14:29:59,603 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-08 14:29:59,603 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-08 14:29:59,603 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-08 14:29:59,603 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-09-08 14:29:59,604 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:29:59,604 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-08 14:29:59,604 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-08 14:29:59,604 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-misc-2-unrolled-atomic.wvr.c_BEv2_Iteration2_Loop [2023-09-08 14:29:59,604 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-08 14:29:59,604 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-08 14:29:59,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:59,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:59,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:59,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:59,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:59,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:59,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:59,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-08 14:29:59,706 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-08 14:29:59,706 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-09-08 14:29:59,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:29:59,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:29:59,709 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) [2023-09-08 14:29:59,714 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 [2023-09-08 14:29:59,715 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 [2023-09-08 14:29:59,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:29:59,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-08 14:29:59,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:29:59,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:29:59,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:29:59,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-08 14:29:59,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-08 14:29:59,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:29:59,732 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 [2023-09-08 14:29:59,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:29:59,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:29:59,733 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) [2023-09-08 14:29:59,735 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 [2023-09-08 14:29:59,737 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 [2023-09-08 14:29:59,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:29:59,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:29:59,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:29:59,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:29:59,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-08 14:29:59,746 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-08 14:29:59,758 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:29:59,761 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 [2023-09-08 14:29:59,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:29:59,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:29:59,763 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) [2023-09-08 14:29:59,764 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 [2023-09-08 14:29:59,766 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 [2023-09-08 14:29:59,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:29:59,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:29:59,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:29:59,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:29:59,774 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-08 14:29:59,774 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-08 14:29:59,786 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:29:59,792 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 [2023-09-08 14:29:59,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:29:59,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:29:59,794 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) [2023-09-08 14:29:59,796 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 [2023-09-08 14:29:59,798 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 [2023-09-08 14:29:59,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:29:59,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:29:59,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:29:59,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:29:59,807 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-08 14:29:59,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-08 14:29:59,825 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-08 14:29:59,829 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 [2023-09-08 14:29:59,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:29:59,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:29:59,830 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) [2023-09-08 14:29:59,833 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 [2023-09-08 14:29:59,834 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 [2023-09-08 14:29:59,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-08 14:29:59,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-08 14:29:59,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-08 14:29:59,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-08 14:29:59,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-08 14:29:59,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-08 14:29:59,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-08 14:29:59,869 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-09-08 14:29:59,871 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-09-08 14:29:59,871 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-09-08 14:29:59,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:29:59,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:29:59,877 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) [2023-09-08 14:29:59,889 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-09-08 14:29:59,890 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-09-08 14:29:59,890 INFO L513 LassoAnalysis]: Proved termination. [2023-09-08 14:29:59,890 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i2~0, ~N~0) = -1*~i2~0 + 2*~N~0 Supporting invariants [] [2023-09-08 14:29:59,902 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 [2023-09-08 14:29:59,902 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 [2023-09-08 14:29:59,903 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-09-08 14:29:59,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:29:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 14:29:59,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2023-09-08 14:29:59,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 14:30:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 14:30:00,026 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-08 14:30:00,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 14:30:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 14:30:00,041 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-09-08 14:30:00,041 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 156 states and 357 transitions. cyclomatic complexity: 234 Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 14:30:00,091 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 156 states and 357 transitions. cyclomatic complexity: 234. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 329 states and 871 transitions. Complement of second has 6 states. [2023-09-08 14:30:00,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-09-08 14:30:00,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 14:30:00,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2023-09-08 14:30:00,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 45 letters. Loop has 2 letters. [2023-09-08 14:30:00,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-08 14:30:00,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 47 letters. Loop has 2 letters. [2023-09-08 14:30:00,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-08 14:30:00,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 45 letters. Loop has 4 letters. [2023-09-08 14:30:00,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-08 14:30:00,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 329 states and 871 transitions. [2023-09-08 14:30:00,100 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-08 14:30:00,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 329 states to 0 states and 0 transitions. [2023-09-08 14:30:00,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-09-08 14:30:00,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-09-08 14:30:00,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-09-08 14:30:00,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-08 14:30:00,101 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-08 14:30:00,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-08 14:30:00,101 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-08 14:30:00,101 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-09-08 14:30:00,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-09-08 14:30:00,101 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-08 14:30:00,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-09-08 14:30:00,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.09 02:30:00 BoogieIcfgContainer [2023-09-08 14:30:00,108 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-09-08 14:30:00,109 INFO L158 Benchmark]: Toolchain (without parser) took 3420.95ms. Allocated memory is still 239.1MB. Free memory was 192.9MB in the beginning and 126.1MB in the end (delta: 66.8MB). Peak memory consumption was 67.8MB. Max. memory is 8.0GB. [2023-09-08 14:30:00,109 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 180.4MB. Free memory was 135.6MB in the beginning and 135.5MB in the end (delta: 155.2kB). There was no memory consumed. Max. memory is 8.0GB. [2023-09-08 14:30:00,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.30ms. Allocated memory is still 239.1MB. Free memory was 192.4MB in the beginning and 181.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-09-08 14:30:00,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.59ms. Allocated memory is still 239.1MB. Free memory was 181.4MB in the beginning and 179.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-09-08 14:30:00,113 INFO L158 Benchmark]: Boogie Preprocessor took 29.16ms. Allocated memory is still 239.1MB. Free memory was 179.8MB in the beginning and 178.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-09-08 14:30:00,115 INFO L158 Benchmark]: RCFGBuilder took 498.86ms. Allocated memory is still 239.1MB. Free memory was 178.7MB in the beginning and 161.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-09-08 14:30:00,115 INFO L158 Benchmark]: BuchiAutomizer took 2669.66ms. Allocated memory is still 239.1MB. Free memory was 161.4MB in the beginning and 126.1MB in the end (delta: 35.3MB). Peak memory consumption was 36.4MB. Max. memory is 8.0GB. [2023-09-08 14:30:00,120 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.15ms. Allocated memory is still 180.4MB. Free memory was 135.6MB in the beginning and 135.5MB in the end (delta: 155.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 191.30ms. Allocated memory is still 239.1MB. Free memory was 192.4MB in the beginning and 181.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.59ms. Allocated memory is still 239.1MB. Free memory was 181.4MB in the beginning and 179.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.16ms. Allocated memory is still 239.1MB. Free memory was 179.8MB in the beginning and 178.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 498.86ms. Allocated memory is still 239.1MB. Free memory was 178.7MB in the beginning and 161.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 2669.66ms. Allocated memory is still 239.1MB. Free memory was 161.4MB in the beginning and 126.1MB in the end (delta: 35.3MB). Peak memory consumption was 36.4MB. 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * N + -1 * i1 and consists of 5 locations. One deterministic module has affine ranking function 2 * N + -1 * i2 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 38 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 202 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 131 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax313 hnf100 lsp25 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-09-08 14:30:00,139 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 [2023-09-08 14:30:00,338 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...