/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/buchiAutomizer/concurrent-automaton-noLbe.epf -i ../../../trunk/examples/svcomp/pthread-lit/sssc12.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 11:40:07,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:40:07,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:40:07,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:40:07,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:40:07,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:40:07,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:40:07,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:40:07,597 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:40:07,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:40:07,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:40:07,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:40:07,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:40:07,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:40:07,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:40:07,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:40:07,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:40:07,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:40:07,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:40:07,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:40:07,614 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:40:07,616 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:40:07,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:40:07,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:40:07,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:40:07,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:40:07,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:40:07,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:40:07,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:40:07,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:40:07,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:40:07,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:40:07,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:40:07,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:40:07,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:40:07,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:40:07,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:40:07,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:40:07,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:40:07,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:40:07,640 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:40:07,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:40:07,645 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2022-07-22 11:40:07,706 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:40:07,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:40:07,710 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:40:07,711 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:40:07,714 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:40:07,714 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:40:07,715 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:40:07,715 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 11:40:07,715 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 11:40:07,717 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 11:40:07,717 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 11:40:07,718 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 11:40:07,718 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 11:40:07,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:40:07,718 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:40:07,719 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 11:40:07,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 11:40:07,719 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:40:07,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:40:07,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 11:40:07,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 11:40:07,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 11:40:07,721 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:40:07,722 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:40:07,722 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 11:40:07,722 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:40:07,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 11:40:07,723 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:40:07,723 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:40:07,724 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:40:07,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 11:40:07,724 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:40:07,727 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 11:40:07,728 INFO L138 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 [2022-07-22 11:40:08,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:40:08,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:40:08,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:40:08,246 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:40:08,247 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:40:08,248 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/sssc12.i [2022-07-22 11:40:08,347 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68051ccea/305ffcf877a74b97b071ed8a4e005675/FLAG228284ad2 [2022-07-22 11:40:09,131 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:40:09,132 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12.i [2022-07-22 11:40:09,154 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68051ccea/305ffcf877a74b97b071ed8a4e005675/FLAG228284ad2 [2022-07-22 11:40:09,394 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68051ccea/305ffcf877a74b97b071ed8a4e005675 [2022-07-22 11:40:09,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:40:09,408 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 11:40:09,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:40:09,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:40:09,416 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:40:09,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:40:09" (1/1) ... [2022-07-22 11:40:09,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72848ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:40:09, skipping insertion in model container [2022-07-22 11:40:09,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:40:09" (1/1) ... [2022-07-22 11:40:09,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:40:09,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:40:10,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12.i[46865,46878] [2022-07-22 11:40:10,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:40:10,088 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:40:10,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12.i[46865,46878] [2022-07-22 11:40:10,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:40:10,225 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:40:10,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:40:10 WrapperNode [2022-07-22 11:40:10,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:40:10,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:40:10,228 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:40:10,228 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:40:10,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:40:10" (1/1) ... [2022-07-22 11:40:10,258 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:40:10" (1/1) ... [2022-07-22 11:40:10,311 INFO L137 Inliner]: procedures = 275, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2022-07-22 11:40:10,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:40:10,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:40:10,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:40:10,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:40:10,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:40:10" (1/1) ... [2022-07-22 11:40:10,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:40:10" (1/1) ... [2022-07-22 11:40:10,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:40:10" (1/1) ... [2022-07-22 11:40:10,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:40:10" (1/1) ... [2022-07-22 11:40:10,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:40:10" (1/1) ... [2022-07-22 11:40:10,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:40:10" (1/1) ... [2022-07-22 11:40:10,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:40:10" (1/1) ... [2022-07-22 11:40:10,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:40:10,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:40:10,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:40:10,349 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:40:10,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:40:10" (1/1) ... [2022-07-22 11:40:10,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:40:10,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:40:10,393 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) [2022-07-22 11:40:10,419 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 [2022-07-22 11:40:10,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 11:40:10,476 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2022-07-22 11:40:10,476 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2022-07-22 11:40:10,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 11:40:10,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 11:40:10,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 11:40:10,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 11:40:10,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 11:40:10,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:40:10,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 11:40:10,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:40:10,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:40:10,481 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 11:40:10,612 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:40:10,614 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:40:10,810 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:40:10,857 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:40:10,857 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 11:40:10,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:40:10 BoogieIcfgContainer [2022-07-22 11:40:10,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:40:10,872 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 11:40:10,872 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 11:40:10,883 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 11:40:10,884 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:40:10,885 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 11:40:09" (1/3) ... [2022-07-22 11:40:10,891 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3dcbb0a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 11:40:10, skipping insertion in model container [2022-07-22 11:40:10,891 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:40:10,891 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:40:10" (2/3) ... [2022-07-22 11:40:10,892 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3dcbb0a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 11:40:10, skipping insertion in model container [2022-07-22 11:40:10,892 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:40:10,892 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:40:10" (3/3) ... [2022-07-22 11:40:10,894 INFO L322 chiAutomizerObserver]: Analyzing ICFG sssc12.i [2022-07-22 11:40:11,070 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-22 11:40:11,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 81 transitions, 167 flow [2022-07-22 11:40:11,204 INFO L129 PetriNetUnfolder]: 8/93 cut-off events. [2022-07-22 11:40:11,204 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-22 11:40:11,214 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 93 events. 8/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 46. Up to 4 conditions per place. [2022-07-22 11:40:11,214 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 81 transitions, 167 flow [2022-07-22 11:40:11,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 81 transitions, 167 flow [2022-07-22 11:40:11,248 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 11:40:11,249 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 11:40:11,249 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 11:40:11,249 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 11:40:11,249 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 11:40:11,249 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 11:40:11,249 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 11:40:11,250 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 11:40:11,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 11:40:11,411 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 183 [2022-07-22 11:40:11,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:40:11,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:40:11,419 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:40:11,419 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 11:40:11,420 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 11:40:11,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 477 states, but on-demand construction may add more states [2022-07-22 11:40:11,442 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 183 [2022-07-22 11:40:11,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:40:11,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:40:11,444 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:40:11,444 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 11:40:11,452 INFO L748 eck$LassoCheckResult]: Stem: 80#[ULTIMATE.startENTRY]don't care [220] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 83#[L-1]don't care [200] L-1-->L-1-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] 85#[L-1-1]don't care [224] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 87#[L-1-2]don't care [225] L-1-2-->L991: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 89#[L991]don't care [164] L991-->L991-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[] 91#[L991-1]don't care [226] L991-1-->L991-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[] 93#[L991-2]don't care [196] L991-2-->L991-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[] 95#[L991-3]don't care [194] L991-3-->L991-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 97#[L991-4]don't care [198] L991-4-->L1006: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset] 99#[L1006]don't care [230] L1006-->L1007: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0] 101#[L1007]don't care [166] L1007-->L1008: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0] 103#[L1008]don't care [184] L1008-->L-1-3: Formula: (= v_~lock~0_1 0) InVars {} OutVars{~lock~0=v_~lock~0_1} AuxVars[] AssignedVars[~lock~0] 105#[L-1-3]don't care [227] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 107#[L-1-4]don't care [211] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 109#[L-1-5]don't care [178] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 111#[L-1-6]don't care [210] L-1-6-->L1039: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~malloc4#1.base, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~malloc4#1.offset, ULTIMATE.start_main_~#t~0#1.base] 113#[L1039]don't care [159] L1039-->L1039-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) 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_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] 115#[L1039-1]don't care [191] L1039-1-->L1041: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0] 117#[L1041]don't care [204] L1041-->L1042: Formula: (= v_~lock~0_2 0) InVars {} OutVars{~lock~0=v_~lock~0_2} AuxVars[] AssignedVars[~lock~0] 119#[L1042]don't care [173] L1042-->L1042-1: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet3#1_2|) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~len~0=v_~len~0_2} AuxVars[] AssignedVars[~len~0] 121#[L1042-1]don't care [228] L1042-1-->L1043: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] 123#[L1043]don't care [215] L1043-->L1043-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 125#[L1043-1]don't care [162] L1043-1-->L1043-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~len~0_3) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, 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] 127#[L1043-2]don't care [206] L1043-2-->L993: 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] 129#[L993]don't care [219] L993-->L994: 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] 131#[L994]don't care [214] L994-->L993-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[] 135#[L993-1]don't care [201] L993-1-->L1044: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 137#[L1044]don't care [155] L1044-->L1044-1: Formula: (and (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_#t~malloc4#1.base_2| (* v_~len~0_4 4)) |v_#length_5|) (= (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc4#1.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc4#1.base_2| |v_#StackHeapBarrier_3|) (= |v_ULTIMATE.start_main_#t~malloc4#1.offset_2| 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc4#1.base_2| 1) |v_#valid_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|, ~len~0=v_~len~0_4} OutVars{ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4, #length=|v_#length_5|, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4#1.base, #valid, #length, ULTIMATE.start_main_#t~malloc4#1.offset] 139#[L1044-1]don't care [177] L1044-1-->L1044-2: Formula: (and (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4#1.offset_3|) (= |v_ULTIMATE.start_main_#t~malloc4#1.base_3| v_~data~0.base_2)) InVars {ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_3|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_3|, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset] 141#[L1044-2]don't care [209] L1044-2-->L1045-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_4|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4#1.base, ULTIMATE.start_main_#t~malloc4#1.offset] 143#[L1045-2]don't care [169] L1045-2-->L1046: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 147#[L1046]don't care [231] L1046-->L1046-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 151#[L1046-1]don't care [186] L1046-1-->L1046-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 155#[L1046-2]don't care [193] L1046-2-->L1046-3: Formula: (and (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 159#[L1046-3]don't care [268] L1046-3-->thrENTRY: Formula: (and (= |v_thrThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_thrThread1of1ForFork0_thidvar0_2) (= |v_thrThread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_thrThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_20|, thrThread1of1ForFork0_~arg#1.offset=|v_thrThread1of1ForFork0_~arg#1.offset_4|, thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_14|, thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_6|, thrThread1of1ForFork0_~arg#1.base=|v_thrThread1of1ForFork0_~arg#1.base_4|, thrThread1of1ForFork0_#in~arg#1.base=|v_thrThread1of1ForFork0_#in~arg#1.base_4|, thrThread1of1ForFork0_thidvar0=v_thrThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, thrThread1of1ForFork0_#res#1.offset=|v_thrThread1of1ForFork0_#res#1.offset_4|, thrThread1of1ForFork0_thidvar1=v_thrThread1of1ForFork0_thidvar1_2, thrThread1of1ForFork0_#in~arg#1.offset=|v_thrThread1of1ForFork0_#in~arg#1.offset_4|, thrThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thrThread1of1ForFork0_#res#1.base=|v_thrThread1of1ForFork0_#res#1.base_4|, thrThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_10|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~c~0#1, thrThread1of1ForFork0_~arg#1.offset, thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1, thrThread1of1ForFork0_~end~0#1, thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of1ForFork0_~arg#1.base, thrThread1of1ForFork0_#in~arg#1.base, thrThread1of1ForFork0_thidvar0, thrThread1of1ForFork0_#res#1.offset, thrThread1of1ForFork0_thidvar1, thrThread1of1ForFork0_#in~arg#1.offset, thrThread1of1ForFork0_assume_abort_if_not_~cond#1, thrThread1of1ForFork0_#res#1.base, thrThread1of1ForFork0___VERIFIER_assert_~cond#1] 163#[L1046-4, thrENTRY]don't care [195] L1046-4-->L1046-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 167#[L1046-5, thrENTRY]don't care [187] L1046-5-->L1045-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 175#[L1045-2, thrENTRY]don't care [169] L1045-2-->L1046: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 185#[L1046, thrENTRY]don't care [231] L1046-->L1046-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 199#[L1046-1, thrENTRY]don't care [186] L1046-1-->L1046-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 217#[L1046-2, thrENTRY]don't care [193] L1046-2-->L1046-3: Formula: (and (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 239#[L1046-3, thrENTRY]don't care [266] L1046-3-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 265#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrENTRY]don't care [2022-07-22 11:40:11,453 INFO L750 eck$LassoCheckResult]: Loop: 265#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrENTRY]don't care [267] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 265#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrENTRY]don't care [2022-07-22 11:40:11,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:40:11,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1529995297, now seen corresponding path program 1 times [2022-07-22 11:40:11,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:40:11,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541427624] [2022-07-22 11:40:11,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:40:11,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:40:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:40:11,637 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:40:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:40:11,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:40:11,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:40:11,719 INFO L85 PathProgramCache]: Analyzing trace with hash 298, now seen corresponding path program 1 times [2022-07-22 11:40:11,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:40:11,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112208636] [2022-07-22 11:40:11,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:40:11,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:40:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:40:11,732 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:40:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:40:11,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:40:11,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:40:11,741 INFO L85 PathProgramCache]: Analyzing trace with hash -185213684, now seen corresponding path program 1 times [2022-07-22 11:40:11,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:40:11,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641062522] [2022-07-22 11:40:11,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:40:11,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:40:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:40:11,809 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:40:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:40:11,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:40:12,862 WARN L146 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-22 11:40:12,887 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-22 11:40:12,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 114 transitions, 240 flow [2022-07-22 11:40:12,927 INFO L129 PetriNetUnfolder]: 13/140 cut-off events. [2022-07-22 11:40:12,927 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 11:40:12,930 INFO L84 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 140 events. 13/140 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 249 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 93. Up to 6 conditions per place. [2022-07-22 11:40:12,930 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 114 transitions, 240 flow [2022-07-22 11:40:12,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 114 transitions, 240 flow [2022-07-22 11:40:12,940 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 11:40:12,940 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 11:40:12,940 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 11:40:12,943 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 11:40:12,943 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 11:40:12,943 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 11:40:12,943 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 11:40:12,944 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 11:40:12,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 11:40:14,165 INFO L131 ngComponentsAnalysis]: Automaton has 893 accepting balls. 8233 [2022-07-22 11:40:14,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:40:14,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:40:14,168 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:40:14,168 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:40:14,169 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 11:40:14,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 13063 states, but on-demand construction may add more states [2022-07-22 11:40:14,490 INFO L131 ngComponentsAnalysis]: Automaton has 893 accepting balls. 8233 [2022-07-22 11:40:14,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:40:14,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:40:14,496 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:40:14,497 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:40:14,499 INFO L748 eck$LassoCheckResult]: Stem: 111#[ULTIMATE.startENTRY]don't care [334] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 114#[L-1]don't care [314] L-1-->L-1-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] 116#[L-1-1]don't care [338] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 118#[L-1-2]don't care [339] L-1-2-->L991: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 120#[L991]don't care [278] L991-->L991-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[] 122#[L991-1]don't care [340] L991-1-->L991-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[] 124#[L991-2]don't care [310] L991-2-->L991-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[] 126#[L991-3]don't care [308] L991-3-->L991-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 128#[L991-4]don't care [312] L991-4-->L1006: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset] 130#[L1006]don't care [344] L1006-->L1007: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0] 132#[L1007]don't care [280] L1007-->L1008: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0] 134#[L1008]don't care [298] L1008-->L-1-3: Formula: (= v_~lock~0_1 0) InVars {} OutVars{~lock~0=v_~lock~0_1} AuxVars[] AssignedVars[~lock~0] 136#[L-1-3]don't care [341] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 138#[L-1-4]don't care [325] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 140#[L-1-5]don't care [292] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 142#[L-1-6]don't care [324] L-1-6-->L1039: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~malloc4#1.base, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~malloc4#1.offset, ULTIMATE.start_main_~#t~0#1.base] 144#[L1039]don't care [273] L1039-->L1039-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) 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_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] 146#[L1039-1]don't care [305] L1039-1-->L1041: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0] 148#[L1041]don't care [318] L1041-->L1042: Formula: (= v_~lock~0_2 0) InVars {} OutVars{~lock~0=v_~lock~0_2} AuxVars[] AssignedVars[~lock~0] 150#[L1042]don't care [287] L1042-->L1042-1: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet3#1_2|) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~len~0=v_~len~0_2} AuxVars[] AssignedVars[~len~0] 152#[L1042-1]don't care [342] L1042-1-->L1043: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] 154#[L1043]don't care [329] L1043-->L1043-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 156#[L1043-1]don't care [276] L1043-1-->L1043-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~len~0_3) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, 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] 158#[L1043-2]don't care [320] L1043-2-->L993: 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] 160#[L993]don't care [333] L993-->L994: 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] 162#[L994]don't care [328] L994-->L993-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[] 166#[L993-1]don't care [315] L993-1-->L1044: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 168#[L1044]don't care [269] L1044-->L1044-1: Formula: (and (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_#t~malloc4#1.base_2| (* v_~len~0_4 4)) |v_#length_5|) (= (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc4#1.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc4#1.base_2| |v_#StackHeapBarrier_3|) (= |v_ULTIMATE.start_main_#t~malloc4#1.offset_2| 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc4#1.base_2| 1) |v_#valid_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|, ~len~0=v_~len~0_4} OutVars{ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4, #length=|v_#length_5|, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4#1.base, #valid, #length, ULTIMATE.start_main_#t~malloc4#1.offset] 170#[L1044-1]don't care [291] L1044-1-->L1044-2: Formula: (and (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4#1.offset_3|) (= |v_ULTIMATE.start_main_#t~malloc4#1.base_3| v_~data~0.base_2)) InVars {ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_3|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_3|, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset] 172#[L1044-2]don't care [323] L1044-2-->L1045-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_4|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4#1.base, ULTIMATE.start_main_#t~malloc4#1.offset] 174#[L1045-2]don't care [283] L1045-2-->L1046: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 178#[L1046]don't care [345] L1046-->L1046-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 182#[L1046-1]don't care [300] L1046-1-->L1046-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 186#[L1046-2]don't care [307] L1046-2-->L1046-3: Formula: (and (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 190#[L1046-3]don't care [414] L1046-3-->thrENTRY: Formula: (and (= v_thrThread1of2ForFork0_thidvar1_2 0) (= |v_thrThread1of2ForFork0_#in~arg#1.base_4| 0) (= v_thrThread1of2ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre5#1_12|) (= |v_thrThread1of2ForFork0_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_12|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_6|, thrThread1of2ForFork0_~arg#1.offset=|v_thrThread1of2ForFork0_~arg#1.offset_4|, thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1_6|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_20|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_4|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_12|, thrThread1of2ForFork0_#res#1.offset=|v_thrThread1of2ForFork0_#res#1.offset_4|, thrThread1of2ForFork0_thidvar1=v_thrThread1of2ForFork0_thidvar1_2, thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_2, thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_10|, thrThread1of2ForFork0_#res#1.base=|v_thrThread1of2ForFork0_#res#1.base_4|, thrThread1of2ForFork0_~arg#1.base=|v_thrThread1of2ForFork0_~arg#1.base_4|, thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_14|, thrThread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of2ForFork0_assume_abort_if_not_~cond#1_6|, thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_4|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of2ForFork0_~arg#1.offset, thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1, thrThread1of2ForFork0_~c~0#1, thrThread1of2ForFork0_#in~arg#1.base, thrThread1of2ForFork0_#res#1.offset, thrThread1of2ForFork0_thidvar1, thrThread1of2ForFork0_thidvar0, thrThread1of2ForFork0___VERIFIER_assert_~cond#1, thrThread1of2ForFork0_#res#1.base, thrThread1of2ForFork0_~arg#1.base, thrThread1of2ForFork0_~end~0#1, thrThread1of2ForFork0_assume_abort_if_not_~cond#1, thrThread1of2ForFork0_#in~arg#1.offset] 194#[L1046-4, thrENTRY]don't care [380] thrENTRY-->L1022: Formula: (and (= |v_thrThread1of2ForFork0_~arg#1.base_1| |v_thrThread1of2ForFork0_#in~arg#1.base_1|) (= |v_thrThread1of2ForFork0_~arg#1.offset_1| |v_thrThread1of2ForFork0_#in~arg#1.offset_1|)) InVars {thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_1|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_1|} OutVars{thrThread1of2ForFork0_~arg#1.offset=|v_thrThread1of2ForFork0_~arg#1.offset_1|, thrThread1of2ForFork0_~arg#1.base=|v_thrThread1of2ForFork0_~arg#1.base_1|, thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_1|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~arg#1.offset, thrThread1of2ForFork0_~arg#1.base] 200#[L1022, L1046-4]don't care [381] L1022-->L1022-1: Formula: true InVars {} OutVars{thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~c~0#1] 208#[L1022-1, L1046-4]don't care [382] L1022-1-->L1023: Formula: true InVars {} OutVars{thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~end~0#1] 218#[L1023, L1046-4]don't care [383] L1023-->L1024: Formula: (= |v_thrThread1of2ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~c~0#1] 232#[L1024, L1046-4]don't care [384] L1024-->L1025: Formula: (= |v_thrThread1of2ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~end~0#1] 250#[L1025, L1046-4]don't care [385] L1025-->L1010: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 272#[L1010, L1046-4]don't care [386] L1010-->L1013: Formula: (and (= |v_thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thrThread1of2ForFork0_assume_abort_if_not_~cond#1_1|) (= v_~lock~0_23 1) (= |v_thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (= v_~lock~0_24 0) 1 0)) (not (= |v_thrThread1of2ForFork0_assume_abort_if_not_~cond#1_1| 0))) InVars {~lock~0=v_~lock~0_24} OutVars{~lock~0=v_~lock~0_23, thrThread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of2ForFork0_assume_abort_if_not_~cond#1_1|, thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~lock~0, thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1, thrThread1of2ForFork0_assume_abort_if_not_~cond#1] 298#[L1046-4, L1013]don't care [387] L1013-->L1026: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 330#[L1046-4, L1026]don't care [389] L1026-->L1026-2: Formula: (not (<= (+ v_~next~0_7 10) v_~len~0_6)) InVars {~next~0=v_~next~0_7, ~len~0=v_~len~0_6} OutVars{~next~0=v_~next~0_7, ~len~0=v_~len~0_6} AuxVars[] AssignedVars[] 372#[L1026-2, L1046-4]don't care [391] L1026-2-->L1016: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 426#[L1016, L1046-4]don't care [393] L1016-->L1019: Formula: (and (= |v_thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thrThread1of2ForFork0_assume_abort_if_not_~cond#1_3|) (= v_~lock~0_29 0) (not (= |v_thrThread1of2ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= |v_thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1_3| (ite (= v_~lock~0_30 1) 1 0))) InVars {~lock~0=v_~lock~0_30} OutVars{~lock~0=v_~lock~0_29, thrThread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of2ForFork0_assume_abort_if_not_~cond#1_3|, thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[~lock~0, thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1, thrThread1of2ForFork0_assume_abort_if_not_~cond#1] 496#[L1019, L1046-4]don't care [395] L1019-->L1031-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 586#[L1031-2, L1046-4]don't care [2022-07-22 11:40:14,499 INFO L750 eck$LassoCheckResult]: Loop: 586#[L1031-2, L1046-4]don't care [398] L1031-2-->L1032: Formula: (< |v_thrThread1of2ForFork0_~c~0#1_9| |v_thrThread1of2ForFork0_~end~0#1_11|) InVars {thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_11|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_9|} OutVars{thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_11|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_9|} AuxVars[] AssignedVars[] 702#[L1032, L1046-4]don't care [400] L1032-->L1032-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 848#[L1032-1, L1046-4]don't care [402] L1032-1-->L1032-2: Formula: (= |v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_1| (ite (and (<= 0 |v_thrThread1of2ForFork0_~c~0#1_11|) (< |v_thrThread1of2ForFork0_~c~0#1_11| v_~len~0_7)) 1 0)) InVars {~len~0=v_~len~0_7, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_11|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_1|, ~len~0=v_~len~0_7, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_11|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1] 1024#[L1032-2, L1046-4]don't care [403] L1032-2-->L996: Formula: true InVars {} OutVars{thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_~cond#1] 1234#[L1046-4, L996]don't care [404] L996-->L997: Formula: (= |v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_3| |v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_3|) InVars {thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_3|, thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_~cond#1] 1482#[L997, L1046-4]don't care [406] L997-->L997-2: Formula: (not (= |v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_7| 0)) InVars {thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_7|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[] 1774#[L997-2, L1046-4]don't care [408] L997-2-->L1033: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2112#[L1046-4, L1033]don't care [410] L1033-->L1033-1: Formula: (let ((.cse0 (* |v_thrThread1of2ForFork0_~c~0#1_13| 4))) (let ((.cse1 (+ v_~data~0.offset_3 .cse0))) (and (<= (+ v_~data~0.offset_3 .cse0 4) (select |v_#length_8| v_~data~0.base_3)) (= (store |v_#memory_int_6| v_~data~0.base_3 (store (select |v_#memory_int_6| v_~data~0.base_3) .cse1 0)) |v_#memory_int_5|) (= (select |v_#valid_11| v_~data~0.base_3) 1) (<= 0 .cse1)))) InVars {~data~0.base=v_~data~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_6|, ~data~0.offset=v_~data~0.offset_3, #length=|v_#length_8|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_13|} OutVars{~data~0.base=v_~data~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ~data~0.offset=v_~data~0.offset_3, #length=|v_#length_8|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_13|} AuxVars[] AssignedVars[#memory_int] 2500#[L1046-4, L1033-1]don't care [411] L1033-1-->L1031-2: Formula: (= |v_thrThread1of2ForFork0_~c~0#1_16| (+ |v_thrThread1of2ForFork0_~c~0#1_15| 1)) InVars {thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_15|} OutVars{thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_16|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~c~0#1] 586#[L1031-2, L1046-4]don't care [2022-07-22 11:40:14,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:40:14,506 INFO L85 PathProgramCache]: Analyzing trace with hash 322098984, now seen corresponding path program 1 times [2022-07-22 11:40:14,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:40:14,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578326163] [2022-07-22 11:40:14,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:40:14,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:40:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:40:14,578 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:40:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:40:14,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:40:14,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:40:14,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1631976301, now seen corresponding path program 1 times [2022-07-22 11:40:14,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:40:14,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807023921] [2022-07-22 11:40:14,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:40:14,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:40:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:40:14,675 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:40:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:40:14,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:40:14,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:40:14,705 INFO L85 PathProgramCache]: Analyzing trace with hash -386315956, now seen corresponding path program 1 times [2022-07-22 11:40:14,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:40:14,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528386822] [2022-07-22 11:40:14,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:40:14,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:40:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:40:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:40:14,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:40:14,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528386822] [2022-07-22 11:40:14,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528386822] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:40:14,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:40:14,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:40:14,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498812333] [2022-07-22 11:40:14,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:40:15,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:40:15,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:40:15,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:40:15,052 INFO L87 Difference]: Start difference. First operand currently 13063 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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) [2022-07-22 11:40:15,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:40:15,339 INFO L93 Difference]: Finished difference Result 8121 states and 24326 transitions. [2022-07-22 11:40:15,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8121 states and 24326 transitions. [2022-07-22 11:40:15,509 INFO L131 ngComponentsAnalysis]: Automaton has 869 accepting balls. 4445 [2022-07-22 11:40:15,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8121 states to 8120 states and 24325 transitions. [2022-07-22 11:40:15,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8120 [2022-07-22 11:40:15,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8120 [2022-07-22 11:40:15,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8120 states and 24325 transitions. [2022-07-22 11:40:15,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 11:40:15,765 INFO L220 hiAutomatonCegarLoop]: Abstraction has 8120 states and 24325 transitions. [2022-07-22 11:40:15,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8120 states and 24325 transitions. [2022-07-22 11:40:16,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8120 to 7427. [2022-07-22 11:40:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7427 states, 7427 states have (on average 3.0259862663255688) internal successors, (22474), 7426 states have internal predecessors, (22474), 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) [2022-07-22 11:40:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7427 states to 7427 states and 22474 transitions. [2022-07-22 11:40:16,351 INFO L242 hiAutomatonCegarLoop]: Abstraction has 7427 states and 22474 transitions. [2022-07-22 11:40:16,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:40:16,356 INFO L425 stractBuchiCegarLoop]: Abstraction has 7427 states and 22474 transitions. [2022-07-22 11:40:16,357 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 11:40:16,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7427 states and 22474 transitions. [2022-07-22 11:40:16,413 INFO L131 ngComponentsAnalysis]: Automaton has 788 accepting balls. 4172 [2022-07-22 11:40:16,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:40:16,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:40:16,415 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:40:16,415 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 11:40:16,417 INFO L748 eck$LassoCheckResult]: Stem: 48078#[ULTIMATE.startENTRY]don't care [334] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 46674#[L-1]don't care [314] L-1-->L-1-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] 37264#[L-1-1]don't care [338] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 37266#[L-1-2]don't care [339] L-1-2-->L991: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 45456#[L991]don't care [278] L991-->L991-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[] 35438#[L991-1]don't care [340] L991-1-->L991-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[] 35440#[L991-2]don't care [310] L991-2-->L991-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[] 41974#[L991-3]don't care [308] L991-3-->L991-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 41324#[L991-4]don't care [312] L991-4-->L1006: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset] 41326#[L1006]don't care [344] L1006-->L1007: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0] 46344#[L1007]don't care [280] L1007-->L1008: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0] 38976#[L1008]don't care [298] L1008-->L-1-3: Formula: (= v_~lock~0_1 0) InVars {} OutVars{~lock~0=v_~lock~0_1} AuxVars[] AssignedVars[~lock~0] 38568#[L-1-3]don't care [341] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 38570#[L-1-4]don't care [325] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 43246#[L-1-5]don't care [292] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 43746#[L-1-6]don't care [324] L-1-6-->L1039: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~malloc4#1.base, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~malloc4#1.offset, ULTIMATE.start_main_~#t~0#1.base] 43748#[L1039]don't care [273] L1039-->L1039-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) 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_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] 46872#[L1039-1]don't care [305] L1039-1-->L1041: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0] 44388#[L1041]don't care [318] L1041-->L1042: Formula: (= v_~lock~0_2 0) InVars {} OutVars{~lock~0=v_~lock~0_2} AuxVars[] AssignedVars[~lock~0] 44390#[L1042]don't care [287] L1042-->L1042-1: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet3#1_2|) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~len~0=v_~len~0_2} AuxVars[] AssignedVars[~len~0] 41604#[L1042-1]don't care [342] L1042-1-->L1043: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] 41606#[L1043]don't care [329] L1043-->L1043-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 44088#[L1043-1]don't care [276] L1043-1-->L1043-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~len~0_3) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, 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] 39028#[L1043-2]don't care [320] L1043-2-->L993: 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] 39030#[L993]don't care [333] L993-->L994: 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] 45444#[L994]don't care [328] L994-->L993-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[] 45446#[L993-1]don't care [315] L993-1-->L1044: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 38222#[L1044]don't care [269] L1044-->L1044-1: Formula: (and (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_#t~malloc4#1.base_2| (* v_~len~0_4 4)) |v_#length_5|) (= (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc4#1.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc4#1.base_2| |v_#StackHeapBarrier_3|) (= |v_ULTIMATE.start_main_#t~malloc4#1.offset_2| 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc4#1.base_2| 1) |v_#valid_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|, ~len~0=v_~len~0_4} OutVars{ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4, #length=|v_#length_5|, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4#1.base, #valid, #length, ULTIMATE.start_main_#t~malloc4#1.offset] 38224#[L1044-1]don't care [291] L1044-1-->L1044-2: Formula: (and (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4#1.offset_3|) (= |v_ULTIMATE.start_main_#t~malloc4#1.base_3| v_~data~0.base_2)) InVars {ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_3|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_3|, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset] 42468#[L1044-2]don't care [323] L1044-2-->L1045-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_4|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4#1.base, ULTIMATE.start_main_#t~malloc4#1.offset] 42898#[L1045-2]don't care [283] L1045-2-->L1046: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 46816#[L1046]don't care [345] L1046-->L1046-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 42324#[L1046-1]don't care [300] L1046-1-->L1046-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 42326#[L1046-2]don't care [307] L1046-2-->L1046-3: Formula: (and (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 44690#[L1046-3]don't care [414] L1046-3-->thrENTRY: Formula: (and (= v_thrThread1of2ForFork0_thidvar1_2 0) (= |v_thrThread1of2ForFork0_#in~arg#1.base_4| 0) (= v_thrThread1of2ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre5#1_12|) (= |v_thrThread1of2ForFork0_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_12|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_6|, thrThread1of2ForFork0_~arg#1.offset=|v_thrThread1of2ForFork0_~arg#1.offset_4|, thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1_6|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_20|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_4|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_12|, thrThread1of2ForFork0_#res#1.offset=|v_thrThread1of2ForFork0_#res#1.offset_4|, thrThread1of2ForFork0_thidvar1=v_thrThread1of2ForFork0_thidvar1_2, thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_2, thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_10|, thrThread1of2ForFork0_#res#1.base=|v_thrThread1of2ForFork0_#res#1.base_4|, thrThread1of2ForFork0_~arg#1.base=|v_thrThread1of2ForFork0_~arg#1.base_4|, thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_14|, thrThread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of2ForFork0_assume_abort_if_not_~cond#1_6|, thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_4|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of2ForFork0_~arg#1.offset, thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1, thrThread1of2ForFork0_~c~0#1, thrThread1of2ForFork0_#in~arg#1.base, thrThread1of2ForFork0_#res#1.offset, thrThread1of2ForFork0_thidvar1, thrThread1of2ForFork0_thidvar0, thrThread1of2ForFork0___VERIFIER_assert_~cond#1, thrThread1of2ForFork0_#res#1.base, thrThread1of2ForFork0_~arg#1.base, thrThread1of2ForFork0_~end~0#1, thrThread1of2ForFork0_assume_abort_if_not_~cond#1, thrThread1of2ForFork0_#in~arg#1.offset] 44692#[L1046-4, thrENTRY]don't care [309] L1046-4-->L1046-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 34508#[L1046-5, thrENTRY]don't care [301] L1046-5-->L1045-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 34512#[L1045-2, thrENTRY]don't care [283] L1045-2-->L1046: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 44296#[L1046, thrENTRY]don't care [345] L1046-->L1046-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 35130#[L1046-1, thrENTRY]don't care [300] L1046-1-->L1046-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 35132#[L1046-2, thrENTRY]don't care [307] L1046-2-->L1046-3: Formula: (and (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 43124#[L1046-3, thrENTRY]don't care [415] L1046-3-->thrENTRY: Formula: (and (= v_thrThread2of2ForFork0_thidvar1_2 0) (= |v_thrThread2of2ForFork0_#in~arg#1.base_4| 0) (= |v_thrThread2of2ForFork0_#in~arg#1.offset_4| 0) (= v_thrThread2of2ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre5#1_14|)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_14|} OutVars{thrThread2of2ForFork0_thidvar1=v_thrThread2of2ForFork0_thidvar1_2, thrThread2of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of2ForFork0___VERIFIER_assert_~cond#1_10|, thrThread2of2ForFork0_#in~arg#1.offset=|v_thrThread2of2ForFork0_#in~arg#1.offset_4|, thrThread2of2ForFork0_~end~0#1=|v_thrThread2of2ForFork0_~end~0#1_14|, thrThread2of2ForFork0_#res#1.base=|v_thrThread2of2ForFork0_#res#1.base_4|, thrThread2of2ForFork0_~arg#1.base=|v_thrThread2of2ForFork0_~arg#1.base_4|, thrThread2of2ForFork0_~arg#1.offset=|v_thrThread2of2ForFork0_~arg#1.offset_4|, thrThread2of2ForFork0_#res#1.offset=|v_thrThread2of2ForFork0_#res#1.offset_4|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_14|, thrThread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of2ForFork0_assume_abort_if_not_~cond#1_6|, thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1_6|, thrThread2of2ForFork0_thidvar0=v_thrThread2of2ForFork0_thidvar0_2, thrThread2of2ForFork0_~c~0#1=|v_thrThread2of2ForFork0_~c~0#1_20|, thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1_6|, thrThread2of2ForFork0_#in~arg#1.base=|v_thrThread2of2ForFork0_#in~arg#1.base_4|} AuxVars[] AssignedVars[thrThread2of2ForFork0_thidvar1, thrThread2of2ForFork0___VERIFIER_assert_~cond#1, thrThread2of2ForFork0_#in~arg#1.offset, thrThread2of2ForFork0_~end~0#1, thrThread2of2ForFork0_#res#1.base, thrThread2of2ForFork0_~arg#1.base, thrThread2of2ForFork0_~arg#1.offset, thrThread2of2ForFork0_#res#1.offset, thrThread2of2ForFork0_assume_abort_if_not_~cond#1, thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of2ForFork0_thidvar0, thrThread2of2ForFork0_~c~0#1, thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of2ForFork0_#in~arg#1.base] 42844#[L1046-4, thrENTRY, thrENTRY]don't care [309] L1046-4-->L1046-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 42846#[thrENTRY, L1046-5, thrENTRY]don't care [301] L1046-5-->L1045-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 36624#[thrENTRY, L1045-2, thrENTRY]don't care [283] L1045-2-->L1046: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 36626#[thrENTRY, L1046, thrENTRY]don't care [345] L1046-->L1046-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 40444#[thrENTRY, L1046-1, thrENTRY]don't care [300] L1046-1-->L1046-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 44496#[L1046-2, thrENTRY, thrENTRY]don't care [307] L1046-2-->L1046-3: Formula: (and (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 47764#[L1046-3, thrENTRY, thrENTRY]don't care [412] L1046-3-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 47880#[thrENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrENTRY]don't care [2022-07-22 11:40:16,417 INFO L750 eck$LassoCheckResult]: Loop: 47880#[thrENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrENTRY]don't care [413] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 47880#[thrENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrENTRY]don't care [2022-07-22 11:40:16,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:40:16,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2047548515, now seen corresponding path program 1 times [2022-07-22 11:40:16,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:40:16,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891283245] [2022-07-22 11:40:16,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:40:16,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:40:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:40:16,444 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:40:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:40:16,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:40:16,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:40:16,469 INFO L85 PathProgramCache]: Analyzing trace with hash 444, now seen corresponding path program 1 times [2022-07-22 11:40:16,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:40:16,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594074458] [2022-07-22 11:40:16,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:40:16,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:40:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:40:16,475 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:40:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:40:16,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:40:16,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:40:16,479 INFO L85 PathProgramCache]: Analyzing trace with hash 950505888, now seen corresponding path program 1 times [2022-07-22 11:40:16,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:40:16,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450213763] [2022-07-22 11:40:16,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:40:16,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:40:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:40:16,502 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:40:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:40:16,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:40:17,663 WARN L146 chiAutomizerObserver]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-22 11:40:17,691 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-22 11:40:17,697 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 139 places, 147 transitions, 315 flow [2022-07-22 11:40:17,733 INFO L129 PetriNetUnfolder]: 18/187 cut-off events. [2022-07-22 11:40:17,733 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-07-22 11:40:17,736 INFO L84 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 187 events. 18/187 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2022-07-22 11:40:17,737 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 147 transitions, 315 flow [2022-07-22 11:40:17,745 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 147 transitions, 315 flow [2022-07-22 11:40:17,746 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 11:40:17,747 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 11:40:17,747 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 11:40:17,747 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 11:40:17,747 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 11:40:17,747 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 11:40:17,747 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 11:40:17,747 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 11:40:17,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 11:40:54,837 INFO L131 ngComponentsAnalysis]: Automaton has 21769 accepting balls. 291579 [2022-07-22 11:40:54,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:40:54,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:40:54,849 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:40:54,850 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:40:54,850 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 11:40:54,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 378057 states, but on-demand construction may add more states [2022-07-22 11:41:06,702 INFO L131 ngComponentsAnalysis]: Automaton has 21769 accepting balls. 291579 [2022-07-22 11:41:06,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:41:06,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:41:06,713 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:41:06,713 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:41:06,714 INFO L748 eck$LassoCheckResult]: Stem: 142#[ULTIMATE.startENTRY]don't care [481] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 145#[L-1]don't care [461] L-1-->L-1-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] 147#[L-1-1]don't care [485] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 149#[L-1-2]don't care [486] L-1-2-->L991: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 151#[L991]don't care [425] L991-->L991-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[] 153#[L991-1]don't care [487] L991-1-->L991-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[] 155#[L991-2]don't care [457] L991-2-->L991-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[] 157#[L991-3]don't care [455] L991-3-->L991-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 159#[L991-4]don't care [459] L991-4-->L1006: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset] 161#[L1006]don't care [491] L1006-->L1007: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0] 163#[L1007]don't care [427] L1007-->L1008: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0] 165#[L1008]don't care [445] L1008-->L-1-3: Formula: (= v_~lock~0_1 0) InVars {} OutVars{~lock~0=v_~lock~0_1} AuxVars[] AssignedVars[~lock~0] 167#[L-1-3]don't care [488] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 169#[L-1-4]don't care [472] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 171#[L-1-5]don't care [439] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 173#[L-1-6]don't care [471] L-1-6-->L1039: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~malloc4#1.base, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~malloc4#1.offset, ULTIMATE.start_main_~#t~0#1.base] 175#[L1039]don't care [420] L1039-->L1039-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) 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_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] 177#[L1039-1]don't care [452] L1039-1-->L1041: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0] 179#[L1041]don't care [465] L1041-->L1042: Formula: (= v_~lock~0_2 0) InVars {} OutVars{~lock~0=v_~lock~0_2} AuxVars[] AssignedVars[~lock~0] 181#[L1042]don't care [434] L1042-->L1042-1: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet3#1_2|) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~len~0=v_~len~0_2} AuxVars[] AssignedVars[~len~0] 183#[L1042-1]don't care [489] L1042-1-->L1043: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] 185#[L1043]don't care [476] L1043-->L1043-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 187#[L1043-1]don't care [423] L1043-1-->L1043-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~len~0_3) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, 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] 189#[L1043-2]don't care [467] L1043-2-->L993: 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] 191#[L993]don't care [480] L993-->L994: 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] 193#[L994]don't care [475] L994-->L993-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[] 197#[L993-1]don't care [462] L993-1-->L1044: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 199#[L1044]don't care [416] L1044-->L1044-1: Formula: (and (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_#t~malloc4#1.base_2| (* v_~len~0_4 4)) |v_#length_5|) (= (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc4#1.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc4#1.base_2| |v_#StackHeapBarrier_3|) (= |v_ULTIMATE.start_main_#t~malloc4#1.offset_2| 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc4#1.base_2| 1) |v_#valid_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|, ~len~0=v_~len~0_4} OutVars{ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4, #length=|v_#length_5|, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4#1.base, #valid, #length, ULTIMATE.start_main_#t~malloc4#1.offset] 201#[L1044-1]don't care [438] L1044-1-->L1044-2: Formula: (and (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4#1.offset_3|) (= |v_ULTIMATE.start_main_#t~malloc4#1.base_3| v_~data~0.base_2)) InVars {ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_3|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_3|, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset] 203#[L1044-2]don't care [470] L1044-2-->L1045-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_4|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4#1.base, ULTIMATE.start_main_#t~malloc4#1.offset] 205#[L1045-2]don't care [430] L1045-2-->L1046: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 209#[L1046]don't care [492] L1046-->L1046-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 213#[L1046-1]don't care [447] L1046-1-->L1046-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 217#[L1046-2]don't care [454] L1046-2-->L1046-3: Formula: (and (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 221#[L1046-3]don't care [593] L1046-3-->thrENTRY: Formula: (and (= v_thrThread1of3ForFork0_thidvar1_2 0) (= v_thrThread1of3ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre5#1_22|) (= |v_thrThread1of3ForFork0_#in~arg#1.base_4| 0) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_22|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_6|, thrThread1of3ForFork0_#res#1.base=|v_thrThread1of3ForFork0_#res#1.base_4|, thrThread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_6|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_20|, thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_10|, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_6|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_22|, thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_4|, thrThread1of3ForFork0_#res#1.offset=|v_thrThread1of3ForFork0_#res#1.offset_4|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_14|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_4|, thrThread1of3ForFork0_thidvar0=v_thrThread1of3ForFork0_thidvar0_2, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_4|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_4|, thrThread1of3ForFork0_thidvar1=v_thrThread1of3ForFork0_thidvar1_2} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of3ForFork0_#res#1.base, thrThread1of3ForFork0_assume_abort_if_not_~cond#1, thrThread1of3ForFork0_~c~0#1, thrThread1of3ForFork0___VERIFIER_assert_~cond#1, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1, thrThread1of3ForFork0_#in~arg#1.base, thrThread1of3ForFork0_#res#1.offset, thrThread1of3ForFork0_~end~0#1, thrThread1of3ForFork0_#in~arg#1.offset, thrThread1of3ForFork0_thidvar0, thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset, thrThread1of3ForFork0_thidvar1] 225#[thrENTRY, L1046-4]don't care [495] thrENTRY-->L1022: Formula: (and (= |v_thrThread1of3ForFork0_~arg#1.base_1| |v_thrThread1of3ForFork0_#in~arg#1.base_1|) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_1| |v_thrThread1of3ForFork0_~arg#1.offset_1|)) InVars {thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_1|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_1|} OutVars{thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_1|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_1|, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_1|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset] 231#[L1022, L1046-4]don't care [496] L1022-->L1022-1: Formula: true InVars {} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1] 239#[L1022-1, L1046-4]don't care [497] L1022-1-->L1023: Formula: true InVars {} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1] 249#[L1023, L1046-4]don't care [498] L1023-->L1024: Formula: (= |v_thrThread1of3ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1] 263#[L1024, L1046-4]don't care [499] L1024-->L1025: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1] 281#[L1025, L1046-4]don't care [500] L1025-->L1010: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 303#[L1010, L1046-4]don't care [501] L1010-->L1013: Formula: (and (not (= |v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= |v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_1| |v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_1|) (= v_~lock~0_23 1) (= |v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (= v_~lock~0_24 0) 1 0))) InVars {~lock~0=v_~lock~0_24} OutVars{~lock~0=v_~lock~0_23, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_1|, thrThread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~lock~0, thrThread1of3ForFork0_assume_abort_if_not_~cond#1, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1] 329#[L1013, L1046-4]don't care [502] L1013-->L1026: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 361#[L1026, L1046-4]don't care [504] L1026-->L1026-2: Formula: (not (<= (+ v_~next~0_7 10) v_~len~0_6)) InVars {~next~0=v_~next~0_7, ~len~0=v_~len~0_6} OutVars{~next~0=v_~next~0_7, ~len~0=v_~len~0_6} AuxVars[] AssignedVars[] 403#[L1026-2, L1046-4]don't care [506] L1026-2-->L1016: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 457#[L1016, L1046-4]don't care [508] L1016-->L1019: Formula: (and (= |v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_3| (ite (= v_~lock~0_30 1) 1 0)) (= v_~lock~0_29 0) (= |v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_3| |v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_3|) (not (= |v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_3| 0))) InVars {~lock~0=v_~lock~0_30} OutVars{~lock~0=v_~lock~0_29, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_3|, thrThread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[~lock~0, thrThread1of3ForFork0_assume_abort_if_not_~cond#1, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1] 527#[L1019, L1046-4]don't care [510] L1019-->L1031-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 617#[L1031-2, L1046-4]don't care [2022-07-22 11:41:06,715 INFO L750 eck$LassoCheckResult]: Loop: 617#[L1031-2, L1046-4]don't care [513] L1031-2-->L1032: Formula: (< |v_thrThread1of3ForFork0_~c~0#1_9| |v_thrThread1of3ForFork0_~end~0#1_11|) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_11|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_9|} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_11|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_9|} AuxVars[] AssignedVars[] 733#[L1032, L1046-4]don't care [515] L1032-->L1032-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 879#[L1032-1, L1046-4]don't care [517] L1032-1-->L1032-2: Formula: (= (ite (and (< |v_thrThread1of3ForFork0_~c~0#1_11| v_~len~0_7) (<= 0 |v_thrThread1of3ForFork0_~c~0#1_11|)) 1 0) |v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_1|) InVars {thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_11|, ~len~0=v_~len~0_7} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_11|, thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_1|, ~len~0=v_~len~0_7} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1] 1059#[L1032-2, L1046-4]don't care [518] L1032-2-->L996: Formula: true InVars {} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_~cond#1] 1283#[L996, L1046-4]don't care [519] L996-->L997: Formula: (= |v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_3| |v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|) InVars {thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_3|, thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_~cond#1] 1565#[L997, L1046-4]don't care [521] L997-->L997-2: Formula: (not (= |v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7| 0)) InVars {thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[] 1925#[L997-2, L1046-4]don't care [523] L997-2-->L1033: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2383#[L1033, L1046-4]don't care [525] L1033-->L1033-1: Formula: (let ((.cse1 (* |v_thrThread1of3ForFork0_~c~0#1_13| 4))) (let ((.cse0 (+ v_~data~0.offset_3 .cse1))) (and (= (store |v_#memory_int_6| v_~data~0.base_3 (store (select |v_#memory_int_6| v_~data~0.base_3) .cse0 0)) |v_#memory_int_5|) (<= 0 .cse0) (= (select |v_#valid_11| v_~data~0.base_3) 1) (<= (+ v_~data~0.offset_3 .cse1 4) (select |v_#length_8| v_~data~0.base_3))))) InVars {~data~0.base=v_~data~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_6|, ~data~0.offset=v_~data~0.offset_3, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_13|, #length=|v_#length_8|} OutVars{~data~0.base=v_~data~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ~data~0.offset=v_~data~0.offset_3, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_13|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 2965#[L1033-1, L1046-4]don't care [526] L1033-1-->L1031-2: Formula: (= |v_thrThread1of3ForFork0_~c~0#1_16| (+ |v_thrThread1of3ForFork0_~c~0#1_15| 1)) InVars {thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_15|} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_16|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1] 617#[L1031-2, L1046-4]don't care [2022-07-22 11:41:06,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:41:06,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1007908155, now seen corresponding path program 1 times [2022-07-22 11:41:06,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:41:06,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247757003] [2022-07-22 11:41:06,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:41:06,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:41:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:41:06,737 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:41:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:41:06,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:41:06,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:41:06,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1909689222, now seen corresponding path program 1 times [2022-07-22 11:41:06,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:41:06,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285964699] [2022-07-22 11:41:06,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:41:06,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:41:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:41:06,769 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:41:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:41:06,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:41:06,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:41:06,778 INFO L85 PathProgramCache]: Analyzing trace with hash 74930060, now seen corresponding path program 1 times [2022-07-22 11:41:06,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:41:06,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913531723] [2022-07-22 11:41:06,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:41:06,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:41:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:41:06,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:41:06,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:41:06,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913531723] [2022-07-22 11:41:06,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913531723] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:41:06,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:41:06,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:41:06,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517713189] [2022-07-22 11:41:06,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:41:06,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:41:06,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:41:06,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:41:06,938 INFO L87 Difference]: Start difference. First operand currently 378057 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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) [2022-07-22 11:41:11,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:41:11,234 INFO L93 Difference]: Finished difference Result 226661 states and 915111 transitions. [2022-07-22 11:41:11,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226661 states and 915111 transitions. [2022-07-22 11:41:19,018 INFO L131 ngComponentsAnalysis]: Automaton has 21027 accepting balls. 157283 [2022-07-22 11:41:27,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226661 states to 226660 states and 915110 transitions. [2022-07-22 11:41:27,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 226660 [2022-07-22 11:41:29,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226660 [2022-07-22 11:41:29,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 226660 states and 915110 transitions. [2022-07-22 11:41:30,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 11:41:30,569 INFO L220 hiAutomatonCegarLoop]: Abstraction has 226660 states and 915110 transitions. [2022-07-22 11:41:32,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226660 states and 915110 transitions. [2022-07-22 11:41:46,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226660 to 207235. [2022-07-22 11:41:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207235 states, 207235 states have (on average 4.068569498395541) internal successors, (843150), 207234 states have internal predecessors, (843150), 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) [2022-07-22 11:41:52,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207235 states to 207235 states and 843150 transitions. [2022-07-22 11:41:52,622 INFO L242 hiAutomatonCegarLoop]: Abstraction has 207235 states and 843150 transitions. [2022-07-22 11:41:52,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:41:52,624 INFO L425 stractBuchiCegarLoop]: Abstraction has 207235 states and 843150 transitions. [2022-07-22 11:41:52,624 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 11:41:52,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 207235 states and 843150 transitions. [2022-07-22 11:41:56,393 INFO L131 ngComponentsAnalysis]: Automaton has 18987 accepting balls. 145859 [2022-07-22 11:41:56,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:41:56,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:41:56,408 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:41:56,408 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:41:56,415 INFO L748 eck$LassoCheckResult]: Stem: 1332113#[ULTIMATE.startENTRY]don't care [481] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1332115#[L-1]don't care [461] L-1-->L-1-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] 990177#[L-1-1]don't care [485] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 990179#[L-1-2]don't care [486] L-1-2-->L991: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 1345909#[L991]don't care [425] L991-->L991-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[] 985599#[L991-1]don't care [487] L991-1-->L991-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[] 985601#[L991-2]don't care [457] L991-2-->L991-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[] 1348083#[L991-3]don't care [455] L991-3-->L991-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 1347911#[L991-4]don't care [459] L991-4-->L1006: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset] 1347913#[L1006]don't care [491] L1006-->L1007: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0] 1346263#[L1007]don't care [427] L1007-->L1008: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0] 1346265#[L1008]don't care [445] L1008-->L-1-3: Formula: (= v_~lock~0_1 0) InVars {} OutVars{~lock~0=v_~lock~0_1} AuxVars[] AssignedVars[~lock~0] 1320511#[L-1-3]don't care [488] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1320513#[L-1-4]don't care [472] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1280313#[L-1-5]don't care [439] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 1013157#[L-1-6]don't care [471] L-1-6-->L1039: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~malloc4#1.base, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~malloc4#1.offset, ULTIMATE.start_main_~#t~0#1.base] 1013159#[L1039]don't care [420] L1039-->L1039-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) 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_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] 1308431#[L1039-1]don't care [452] L1039-1-->L1041: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0] 1348969#[L1041]don't care [465] L1041-->L1042: Formula: (= v_~lock~0_2 0) InVars {} OutVars{~lock~0=v_~lock~0_2} AuxVars[] AssignedVars[~lock~0] 1312527#[L1042]don't care [434] L1042-->L1042-1: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet3#1_2|) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~len~0=v_~len~0_2} AuxVars[] AssignedVars[~len~0] 1312529#[L1042-1]don't care [489] L1042-1-->L1043: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] 1324197#[L1043]don't care [476] L1043-->L1043-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1324199#[L1043-1]don't care [423] L1043-1-->L1043-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~len~0_3) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, 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] 1368505#[L1043-2]don't care [467] L1043-2-->L993: 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] 1368507#[L993]don't care [480] L993-->L994: 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] 1237527#[L994]don't care [475] L994-->L993-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[] 1237529#[L993-1]don't care [462] L993-1-->L1044: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1354017#[L1044]don't care [416] L1044-->L1044-1: Formula: (and (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_#t~malloc4#1.base_2| (* v_~len~0_4 4)) |v_#length_5|) (= (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc4#1.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc4#1.base_2| |v_#StackHeapBarrier_3|) (= |v_ULTIMATE.start_main_#t~malloc4#1.offset_2| 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc4#1.base_2| 1) |v_#valid_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|, ~len~0=v_~len~0_4} OutVars{ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4, #length=|v_#length_5|, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4#1.base, #valid, #length, ULTIMATE.start_main_#t~malloc4#1.offset] 1337747#[L1044-1]don't care [438] L1044-1-->L1044-2: Formula: (and (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4#1.offset_3|) (= |v_ULTIMATE.start_main_#t~malloc4#1.base_3| v_~data~0.base_2)) InVars {ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_3|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_3|, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset] 1301937#[L1044-2]don't care [470] L1044-2-->L1045-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc4#1.offset=|v_ULTIMATE.start_main_#t~malloc4#1.offset_4|, ULTIMATE.start_main_#t~malloc4#1.base=|v_ULTIMATE.start_main_#t~malloc4#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4#1.base, ULTIMATE.start_main_#t~malloc4#1.offset] 1259179#[L1045-2]don't care [430] L1045-2-->L1046: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1259181#[L1046]don't care [492] L1046-->L1046-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 1354781#[L1046-1]don't care [447] L1046-1-->L1046-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 1354783#[L1046-2]don't care [454] L1046-2-->L1046-3: Formula: (and (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 1349081#[L1046-3]don't care [593] L1046-3-->thrENTRY: Formula: (and (= v_thrThread1of3ForFork0_thidvar1_2 0) (= v_thrThread1of3ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre5#1_22|) (= |v_thrThread1of3ForFork0_#in~arg#1.base_4| 0) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_22|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_6|, thrThread1of3ForFork0_#res#1.base=|v_thrThread1of3ForFork0_#res#1.base_4|, thrThread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_6|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_20|, thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_10|, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_6|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_22|, thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_4|, thrThread1of3ForFork0_#res#1.offset=|v_thrThread1of3ForFork0_#res#1.offset_4|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_14|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_4|, thrThread1of3ForFork0_thidvar0=v_thrThread1of3ForFork0_thidvar0_2, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_4|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_4|, thrThread1of3ForFork0_thidvar1=v_thrThread1of3ForFork0_thidvar1_2} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of3ForFork0_#res#1.base, thrThread1of3ForFork0_assume_abort_if_not_~cond#1, thrThread1of3ForFork0_~c~0#1, thrThread1of3ForFork0___VERIFIER_assert_~cond#1, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1, thrThread1of3ForFork0_#in~arg#1.base, thrThread1of3ForFork0_#res#1.offset, thrThread1of3ForFork0_~end~0#1, thrThread1of3ForFork0_#in~arg#1.offset, thrThread1of3ForFork0_thidvar0, thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset, thrThread1of3ForFork0_thidvar1] 1326621#[thrENTRY, L1046-4]don't care [495] thrENTRY-->L1022: Formula: (and (= |v_thrThread1of3ForFork0_~arg#1.base_1| |v_thrThread1of3ForFork0_#in~arg#1.base_1|) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_1| |v_thrThread1of3ForFork0_~arg#1.offset_1|)) InVars {thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_1|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_1|} OutVars{thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_1|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_1|, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_1|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset] 1199903#[L1022, L1046-4]don't care [496] L1022-->L1022-1: Formula: true InVars {} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1] 1199905#[L1022-1, L1046-4]don't care [497] L1022-1-->L1023: Formula: true InVars {} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1] 1357639#[L1023, L1046-4]don't care [498] L1023-->L1024: Formula: (= |v_thrThread1of3ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1] 1310211#[L1024, L1046-4]don't care [499] L1024-->L1025: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1] 990971#[L1025, L1046-4]don't care [500] L1025-->L1010: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 990973#[L1010, L1046-4]don't care [501] L1010-->L1013: Formula: (and (not (= |v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= |v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_1| |v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_1|) (= v_~lock~0_23 1) (= |v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (= v_~lock~0_24 0) 1 0))) InVars {~lock~0=v_~lock~0_24} OutVars{~lock~0=v_~lock~0_23, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_1|, thrThread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~lock~0, thrThread1of3ForFork0_assume_abort_if_not_~cond#1, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1] 1289029#[L1013, L1046-4]don't care [502] L1013-->L1026: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1291745#[L1026, L1046-4]don't care [503] L1026-->L1027: Formula: (<= (+ v_~next~0_3 10) v_~len~0_5) InVars {~next~0=v_~next~0_3, ~len~0=v_~len~0_5} OutVars{~next~0=v_~next~0_3, ~len~0=v_~len~0_5} AuxVars[] AssignedVars[] 1246765#[L1027, L1046-4]don't care [505] L1027-->L1028: Formula: (= v_~next~0_4 |v_thrThread1of3ForFork0_~c~0#1_5|) InVars {~next~0=v_~next~0_4} OutVars{~next~0=v_~next~0_4, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_5|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1] 1246769#[L1028, L1046-4]don't care [507] L1028-->L1028-1: Formula: (= (+ v_~next~0_5 10) |v_thrThread1of3ForFork0_~end~0#1_5|) InVars {~next~0=v_~next~0_5} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_5|, ~next~0=v_~next~0_5} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1] 1268395#[L1028-1, L1046-4]don't care [509] L1028-1-->L1026-2: Formula: (= v_~next~0_6 |v_thrThread1of3ForFork0_~end~0#1_7|) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_7|} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_7|, ~next~0=v_~next~0_6} AuxVars[] AssignedVars[~next~0] 1363139#[L1026-2, L1046-4]don't care [506] L1026-2-->L1016: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1371911#[L1016, L1046-4]don't care [508] L1016-->L1019: Formula: (and (= |v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_3| (ite (= v_~lock~0_30 1) 1 0)) (= v_~lock~0_29 0) (= |v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_3| |v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_3|) (not (= |v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_3| 0))) InVars {~lock~0=v_~lock~0_30} OutVars{~lock~0=v_~lock~0_29, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_3|, thrThread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[~lock~0, thrThread1of3ForFork0_assume_abort_if_not_~cond#1, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1] 1372219#[L1019, L1046-4]don't care [510] L1019-->L1031-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1294677#[L1031-2, L1046-4]don't care [2022-07-22 11:41:56,417 INFO L750 eck$LassoCheckResult]: Loop: 1294677#[L1031-2, L1046-4]don't care [513] L1031-2-->L1032: Formula: (< |v_thrThread1of3ForFork0_~c~0#1_9| |v_thrThread1of3ForFork0_~end~0#1_11|) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_11|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_9|} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_11|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_9|} AuxVars[] AssignedVars[] 1217049#[L1032, L1046-4]don't care [515] L1032-->L1032-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1217051#[L1032-1, L1046-4]don't care [517] L1032-1-->L1032-2: Formula: (= (ite (and (< |v_thrThread1of3ForFork0_~c~0#1_11| v_~len~0_7) (<= 0 |v_thrThread1of3ForFork0_~c~0#1_11|)) 1 0) |v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_1|) InVars {thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_11|, ~len~0=v_~len~0_7} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_11|, thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_1|, ~len~0=v_~len~0_7} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1] 1357105#[L1032-2, L1046-4]don't care [518] L1032-2-->L996: Formula: true InVars {} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_~cond#1] 1060181#[L996, L1046-4]don't care [519] L996-->L997: Formula: (= |v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_3| |v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|) InVars {thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_3|, thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_~cond#1] 1033681#[L997, L1046-4]don't care [521] L997-->L997-2: Formula: (not (= |v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7| 0)) InVars {thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[] 1033687#[L997-2, L1046-4]don't care [523] L997-2-->L1033: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1087861#[L1033, L1046-4]don't care [525] L1033-->L1033-1: Formula: (let ((.cse1 (* |v_thrThread1of3ForFork0_~c~0#1_13| 4))) (let ((.cse0 (+ v_~data~0.offset_3 .cse1))) (and (= (store |v_#memory_int_6| v_~data~0.base_3 (store (select |v_#memory_int_6| v_~data~0.base_3) .cse0 0)) |v_#memory_int_5|) (<= 0 .cse0) (= (select |v_#valid_11| v_~data~0.base_3) 1) (<= (+ v_~data~0.offset_3 .cse1 4) (select |v_#length_8| v_~data~0.base_3))))) InVars {~data~0.base=v_~data~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_6|, ~data~0.offset=v_~data~0.offset_3, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_13|, #length=|v_#length_8|} OutVars{~data~0.base=v_~data~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ~data~0.offset=v_~data~0.offset_3, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_13|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 1087865#[L1033-1, L1046-4]don't care [526] L1033-1-->L1031-2: Formula: (= |v_thrThread1of3ForFork0_~c~0#1_16| (+ |v_thrThread1of3ForFork0_~c~0#1_15| 1)) InVars {thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_15|} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_16|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1] 1294677#[L1031-2, L1046-4]don't care [2022-07-22 11:41:56,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:41:56,418 INFO L85 PathProgramCache]: Analyzing trace with hash -441104351, now seen corresponding path program 1 times [2022-07-22 11:41:56,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:41:56,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821279385] [2022-07-22 11:41:56,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:41:56,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:41:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:41:56,467 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:41:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:41:56,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:41:56,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:41:56,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1909689222, now seen corresponding path program 2 times [2022-07-22 11:41:56,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:41:56,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466605724] [2022-07-22 11:41:56,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:41:56,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:41:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:41:56,530 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:41:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:41:56,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:41:56,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:41:56,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1488807782, now seen corresponding path program 1 times [2022-07-22 11:41:56,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:41:56,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710022883] [2022-07-22 11:41:56,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:41:56,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:41:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:41:56,599 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:41:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:41:56,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:41:58,126 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:41:58,127 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:41:58,127 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:41:58,127 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:41:58,127 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 11:41:58,127 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:41:58,128 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:41:58,128 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:41:58,129 INFO L133 ssoRankerPreferences]: Filename of dumped script: sssc12.i_BEv2_Iteration2_Lasso [2022-07-22 11:41:58,130 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:41:58,130 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:41:58,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:58,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:41:59,396 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:41:59,403 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 11:41:59,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:41:59,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:41:59,407 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) [2022-07-22 11:41:59,409 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 [2022-07-22 11:41:59,412 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 [2022-07-22 11:41:59,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:41:59,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:41:59,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:41:59,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:41:59,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:41:59,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:41:59,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:41:59,449 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:41:59,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 11:41:59,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:41:59,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:41:59,497 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) [2022-07-22 11:41:59,500 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 [2022-07-22 11:41:59,502 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 [2022-07-22 11:41:59,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:41:59,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:41:59,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:41:59,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:41:59,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:41:59,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:41:59,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:41:59,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-22 11:41:59,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:41:59,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:41:59,573 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) [2022-07-22 11:41:59,575 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 [2022-07-22 11:41:59,577 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 [2022-07-22 11:41:59,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:41:59,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:41:59,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:41:59,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:41:59,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:41:59,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:41:59,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:41:59,656 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 [2022-07-22 11:41:59,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:41:59,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:41:59,665 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) [2022-07-22 11:41:59,715 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 [2022-07-22 11:41:59,716 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 [2022-07-22 11:41:59,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:41:59,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:41:59,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:41:59,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:41:59,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:41:59,728 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:41:59,739 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:41:59,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-22 11:41:59,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:41:59,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:41:59,799 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) [2022-07-22 11:41:59,813 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 [2022-07-22 11:41:59,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:41:59,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:41:59,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:41:59,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:41:59,824 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:41:59,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:41:59,841 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 [2022-07-22 11:41:59,844 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:41:59,893 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 [2022-07-22 11:41:59,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:41:59,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:41:59,897 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) [2022-07-22 11:41:59,899 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 [2022-07-22 11:41:59,904 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 [2022-07-22 11:41:59,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:41:59,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:41:59,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:41:59,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:41:59,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:41:59,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:41:59,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:41:59,924 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:41:59,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-22 11:41:59,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:41:59,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:41:59,976 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) [2022-07-22 11:42:00,020 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 [2022-07-22 11:42:00,021 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 [2022-07-22 11:42:00,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:00,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:42:00,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:00,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:00,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:00,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:42:00,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:42:00,041 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:00,094 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 [2022-07-22 11:42:00,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:00,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:00,096 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) [2022-07-22 11:42:00,103 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 [2022-07-22 11:42:00,105 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 [2022-07-22 11:42:00,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:00,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:00,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:00,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:00,116 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:00,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:00,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:00,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-07-22 11:42:00,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:00,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:00,172 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) [2022-07-22 11:42:00,176 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 [2022-07-22 11:42:00,177 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 [2022-07-22 11:42:00,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:00,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:00,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:00,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:00,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:00,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:00,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:00,253 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 [2022-07-22 11:42:00,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:00,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:00,254 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) [2022-07-22 11:42:00,264 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 [2022-07-22 11:42:00,265 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 [2022-07-22 11:42:00,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:00,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:00,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:00,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:00,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:00,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:00,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:00,354 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 [2022-07-22 11:42:00,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:00,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:00,356 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) [2022-07-22 11:42:00,364 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 [2022-07-22 11:42:00,365 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 [2022-07-22 11:42:00,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:00,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:00,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:00,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:00,385 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:00,385 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:00,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:00,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-22 11:42:00,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:00,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:00,467 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) [2022-07-22 11:42:00,473 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 [2022-07-22 11:42:00,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:00,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:00,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:00,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:00,486 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:00,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:00,491 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 [2022-07-22 11:42:00,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:00,588 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 [2022-07-22 11:42:00,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:00,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:00,593 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) [2022-07-22 11:42:00,602 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 [2022-07-22 11:42:00,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:00,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:00,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:00,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:00,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:00,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:00,618 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 [2022-07-22 11:42:00,634 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:00,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-22 11:42:00,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:00,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:00,683 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) [2022-07-22 11:42:00,725 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 [2022-07-22 11:42:00,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:00,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:42:00,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:00,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:00,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:00,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:42:00,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:42:00,737 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 [2022-07-22 11:42:00,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:00,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-22 11:42:00,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:00,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:00,810 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) [2022-07-22 11:42:00,819 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 [2022-07-22 11:42:00,820 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 [2022-07-22 11:42:00,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:00,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:00,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:00,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:00,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:00,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:00,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:00,949 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 [2022-07-22 11:42:00,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:00,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:00,957 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) [2022-07-22 11:42:00,998 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 [2022-07-22 11:42:00,998 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 [2022-07-22 11:42:01,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:01,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:01,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:01,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:01,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:01,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:01,030 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:01,122 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 [2022-07-22 11:42:01,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:01,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:01,129 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:01,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 11:42:01,136 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 [2022-07-22 11:42:01,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:01,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:01,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:01,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:01,146 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:01,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:01,155 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:01,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-07-22 11:42:01,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:01,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:01,197 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:01,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 11:42:01,204 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 [2022-07-22 11:42:01,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:01,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:01,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:01,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:01,216 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:01,216 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:01,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:01,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:01,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:01,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:01,273 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:01,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 11:42:01,278 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 [2022-07-22 11:42:01,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:01,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:01,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:01,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:01,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:01,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:01,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:01,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-07-22 11:42:01,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:01,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:01,344 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:01,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 11:42:01,349 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 [2022-07-22 11:42:01,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:01,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:01,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:01,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:01,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:01,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:01,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:01,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-07-22 11:42:01,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:01,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:01,438 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:01,478 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 [2022-07-22 11:42:01,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 11:42:01,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:01,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:01,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:01,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:01,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:01,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:01,504 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:01,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:01,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:01,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:01,585 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:01,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 11:42:01,593 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 [2022-07-22 11:42:01,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:01,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:01,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:01,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:01,603 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:01,603 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:01,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:01,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:01,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:01,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:01,661 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:01,665 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 [2022-07-22 11:42:01,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 11:42:01,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:01,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:01,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:01,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:01,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:01,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:01,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:01,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:01,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:01,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:01,731 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:01,733 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 [2022-07-22 11:42:01,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:01,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:01,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:01,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:01,745 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:01,745 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:01,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 11:42:01,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:01,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:01,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:01,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:01,807 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:01,810 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 [2022-07-22 11:42:01,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:01,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:01,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:01,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:01,822 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:01,822 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:01,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 11:42:01,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:01,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:01,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:01,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:01,877 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:01,880 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 [2022-07-22 11:42:01,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:01,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:01,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:01,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:01,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:01,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:01,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 11:42:01,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:01,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:01,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:01,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:01,947 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:01,950 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 [2022-07-22 11:42:01,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:01,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:42:01,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:01,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:01,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:01,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:42:01,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:42:01,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 11:42:01,973 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:02,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:02,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:02,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:02,015 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:02,018 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 [2022-07-22 11:42:02,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:02,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:02,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:02,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:02,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:02,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:02,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 11:42:02,042 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:02,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:02,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:02,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:02,086 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:02,089 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 [2022-07-22 11:42:02,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:02,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:42:02,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:02,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:02,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:02,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:42:02,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:42:02,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-22 11:42:02,110 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:02,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:02,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:02,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:02,153 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:02,157 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 [2022-07-22 11:42:02,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:02,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:02,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:02,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:02,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:02,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:02,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-22 11:42:02,180 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:02,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:02,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:02,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:02,222 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:02,224 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 [2022-07-22 11:42:02,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:02,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:42:02,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:02,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:02,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:02,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:42:02,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:42:02,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-22 11:42:02,257 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:02,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:02,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:02,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:02,298 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:02,300 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 [2022-07-22 11:42:02,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:02,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:02,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:02,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:02,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:02,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:02,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-22 11:42:02,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:02,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:02,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:02,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:02,365 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:02,368 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 [2022-07-22 11:42:02,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-22 11:42:02,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:02,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:02,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:02,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:02,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:02,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:02,394 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:02,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:02,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:02,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:02,435 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:02,441 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 [2022-07-22 11:42:02,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:02,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:02,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:02,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:02,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:02,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:02,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-22 11:42:02,464 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:02,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:02,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:02,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:02,505 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:02,509 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 [2022-07-22 11:42:02,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:02,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:02,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:02,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:02,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:02,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:02,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-22 11:42:02,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:02,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:02,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:02,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:02,572 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:02,577 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 [2022-07-22 11:42:02,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:02,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:02,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:02,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:02,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:02,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:02,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-22 11:42:02,609 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:02,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:02,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:02,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:02,675 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:02,684 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 [2022-07-22 11:42:02,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:02,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:02,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:02,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:02,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-22 11:42:02,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:02,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:02,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:02,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:02,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:02,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:02,760 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:02,767 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 [2022-07-22 11:42:02,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:02,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:02,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:02,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:02,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:02,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:02,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-22 11:42:02,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:02,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:02,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:02,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:02,851 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:02,854 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 [2022-07-22 11:42:02,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:02,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:02,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:02,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:02,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:02,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:02,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-22 11:42:02,878 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:02,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-22 11:42:02,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:02,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:02,919 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:02,922 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 [2022-07-22 11:42:02,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:02,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:02,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:02,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:02,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:02,937 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:02,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-22 11:42:02,949 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:02,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:02,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:02,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:02,990 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:02,999 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 [2022-07-22 11:42:03,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:03,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:03,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:03,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:03,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:03,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:03,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-22 11:42:03,030 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:03,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:03,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:03,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:03,079 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:03,083 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 [2022-07-22 11:42:03,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:03,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:03,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:03,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:03,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:03,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:03,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-22 11:42:03,108 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:03,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:03,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:03,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:03,149 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:03,152 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 [2022-07-22 11:42:03,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:03,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:03,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:03,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:03,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:03,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:03,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-22 11:42:03,176 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:03,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:03,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:03,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:03,217 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:03,219 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 [2022-07-22 11:42:03,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:03,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:03,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:03,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:03,230 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:03,230 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:03,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-22 11:42:03,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:03,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:03,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:03,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:03,288 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:03,304 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 [2022-07-22 11:42:03,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-22 11:42:03,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:03,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:03,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:03,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:03,315 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:03,315 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:03,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:03,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:03,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:03,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:03,375 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:03,378 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 [2022-07-22 11:42:03,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:03,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:03,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:03,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:03,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:03,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:03,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-22 11:42:03,402 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:03,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:03,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:03,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:03,451 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:03,459 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 [2022-07-22 11:42:03,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:03,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:42:03,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:03,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:03,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:03,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:42:03,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:42:03,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-22 11:42:03,482 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:03,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:03,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:03,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:03,522 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:42:03,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-22 11:42:03,526 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 [2022-07-22 11:42:03,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:03,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:03,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:03,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:03,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:03,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:03,540 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:03,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-22 11:42:03,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:03,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:03,566 INFO L229 MonitoredProcess]: Starting monitored process 50 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) [2022-07-22 11:42:03,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-22 11:42:03,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:42:03,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:03,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:03,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:03,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:03,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:03,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:03,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:03,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-07-22 11:42:03,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:03,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:03,608 INFO L229 MonitoredProcess]: Starting monitored process 51 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) [2022-07-22 11:42:03,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-22 11:42:03,610 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 [2022-07-22 11:42:03,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:03,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:03,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:03,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:03,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:03,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:03,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:03,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-07-22 11:42:03,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:03,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:03,649 INFO L229 MonitoredProcess]: Starting monitored process 52 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) [2022-07-22 11:42:03,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-22 11:42:03,651 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 [2022-07-22 11:42:03,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:03,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:03,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:03,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:03,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:03,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:03,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:42:03,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-22 11:42:03,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:03,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:03,687 INFO L229 MonitoredProcess]: Starting monitored process 53 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) [2022-07-22 11:42:03,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-22 11:42:03,689 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 [2022-07-22 11:42:03,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:42:03,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:42:03,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:42:03,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:42:03,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:42:03,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:42:03,726 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 11:42:03,753 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-22 11:42:03,753 INFO L444 ModelExtractionUtils]: 13 out of 25 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-22 11:42:03,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:42:03,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:42:03,757 INFO L229 MonitoredProcess]: Starting monitored process 54 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) [2022-07-22 11:42:03,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-22 11:42:03,780 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 11:42:03,805 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 11:42:03,806 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 11:42:03,806 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~len~0, thrThread1of3ForFork0_~c~0#1) = 1*~len~0 - 1*thrThread1of3ForFork0_~c~0#1 Supporting invariants [] [2022-07-22 11:42:03,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:03,897 INFO L257 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-07-22 11:42:03,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:42:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:42:03,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:42:03,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:42:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:42:04,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 11:42:04,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:42:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:42:04,279 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2022-07-22 11:42:04,281 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 207235 states and 843150 transitions. cyclomatic complexity: 654902 Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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) [2022-07-22 11:42:05,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-07-22 11:42:12,244 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 207235 states and 843150 transitions. cyclomatic complexity: 654902. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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 343200 states and 1496506 transitions. Complement of second has 10 states. [2022-07-22 11:42:12,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-22 11:42:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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) [2022-07-22 11:42:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 470 transitions. [2022-07-22 11:42:12,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 470 transitions. Stem has 50 letters. Loop has 9 letters. [2022-07-22 11:42:12,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:42:12,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 470 transitions. Stem has 59 letters. Loop has 9 letters. [2022-07-22 11:42:12,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:42:12,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 470 transitions. Stem has 50 letters. Loop has 18 letters. [2022-07-22 11:42:12,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:42:12,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 343200 states and 1496506 transitions. [2022-07-22 11:42:23,457 INFO L131 ngComponentsAnalysis]: Automaton has 21760 accepting balls. 121856 [2022-07-22 11:42:31,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 343200 states to 310826 states and 1326689 transitions. [2022-07-22 11:42:31,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220179 [2022-07-22 11:42:32,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 246077 [2022-07-22 11:42:32,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 310826 states and 1326689 transitions. [2022-07-22 11:42:32,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 11:42:32,862 INFO L220 hiAutomatonCegarLoop]: Abstraction has 310826 states and 1326689 transitions. [2022-07-22 11:42:34,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310826 states and 1326689 transitions. Received shutdown request... [2022-07-22 11:42:50,432 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-07-22 11:42:51,518 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 Cannot interrupt operation gracefully because timeout expired. Forcing shutdown [2022-07-22 11:42:55,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310826 to 278458. [2022-07-22 11:42:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278458 states, 278458 states have (on average 4.271757320673135) internal successors, (1189505), 278457 states have internal predecessors, (1189505), 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) [2022-07-22 11:42:59,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 11:42:59 BoogieIcfgContainer [2022-07-22 11:42:59,010 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 11:42:59,012 INFO L158 Benchmark]: Toolchain (without parser) took 169608.12ms. Allocated memory was 151.0MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 122.5MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 5.1GB. Max. memory is 8.0GB. [2022-07-22 11:42:59,012 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 151.0MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 11:42:59,016 INFO L158 Benchmark]: CACSL2BoogieTranslator took 816.49ms. Allocated memory is still 151.0MB. Free memory was 122.3MB in the beginning and 94.9MB in the end (delta: 27.5MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-07-22 11:42:59,017 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.04ms. Allocated memory is still 151.0MB. Free memory was 94.9MB in the beginning and 132.6MB in the end (delta: -37.8MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. [2022-07-22 11:42:59,018 INFO L158 Benchmark]: Boogie Preprocessor took 35.72ms. Allocated memory is still 151.0MB. Free memory was 132.6MB in the beginning and 130.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 11:42:59,018 INFO L158 Benchmark]: RCFGBuilder took 522.12ms. Allocated memory is still 151.0MB. Free memory was 130.9MB in the beginning and 117.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-07-22 11:42:59,019 INFO L158 Benchmark]: BuchiAutomizer took 168137.93ms. Allocated memory was 151.0MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 117.8MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 5.1GB. Max. memory is 8.0GB. [2022-07-22 11:42:59,026 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 151.0MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 816.49ms. Allocated memory is still 151.0MB. Free memory was 122.3MB in the beginning and 94.9MB in the end (delta: 27.5MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 84.04ms. Allocated memory is still 151.0MB. Free memory was 94.9MB in the beginning and 132.6MB in the end (delta: -37.8MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.72ms. Allocated memory is still 151.0MB. Free memory was 132.6MB in the beginning and 130.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 522.12ms. Allocated memory is still 151.0MB. Free memory was 130.9MB in the beginning and 117.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 168137.93ms. Allocated memory was 151.0MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 117.8MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 5.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Decomposition not yet finished - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 161.4s and 5 iterations. TraceHistogramMax:3. Analysis of lassos took 10.8s. Construction of modules took 0.2s. Büchi inclusion checks took 55.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 1. Automata minimization 48.8s AutomataMinimizationTime, 3 MinimizatonAttempts, 20118 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 35.1s Buchi closure took 3.7s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 651 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 650 mSDsluCounter, 1932 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1303 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 349 IncrementalHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 740 mSDtfsCounter, 349 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont2 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital224 mio100 ax196 hnf100 lsp41 ukn84 mio100 lsp41 div100 bol100 ite100 ukn100 eq166 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while BuchiAutomatonCegarLoop was minimizing (MINIMIZE_SEVPA) automaton with 310826 states,while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). RESULT: Ultimate could not prove your program: Timeout !SESSION 2022-07-22 11:40:05.651 ----------------------------------------------- eclipse.buildId=unknown java.version=11.0.15 java.vendor=Eclipse Adoptium BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_GB Framework arguments: -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -i ../../../trunk/examples/svcomp/pthread-lit/sssc12.i Command-line arguments: -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -i ../../../trunk/examples/svcomp/pthread-lit/sssc12.i !ENTRY org.eclipse.osgi 4 0 2022-07-22 11:42:59.084 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(/)[568]: java.io.FileNotFoundException: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68051ccea/.metadata/.plugins/org.eclipse.core.resources/.root/1.tree (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:298) at java.base/java.io.FileOutputStream.(FileOutputStream.java:237) at java.base/java.io.FileOutputStream.(FileOutputStream.java:187) at org.eclipse.core.internal.localstore.SafeFileOutputStream.(SafeFileOutputStream.java:55) at org.eclipse.core.internal.resources.SaveManager.saveTree(SaveManager.java:1381) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1168) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2333) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2322) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:191) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:657) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:594) at org.eclipse.equinox.launcher.Main.run(Main.java:1465) at org.eclipse.equinox.launcher.Main.main(Main.java:1438) An error has occurred. See the log file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68051ccea/.metadata/.log.