/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-syntacticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-figure1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 14:15:57,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 14:15:57,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 14:15:57,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 14:15:57,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 14:15:57,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 14:15:57,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 14:15:57,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 14:15:57,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 14:15:57,177 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 14:15:57,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 14:15:57,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 14:15:57,179 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 14:15:57,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 14:15:57,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 14:15:57,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 14:15:57,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 14:15:57,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 14:15:57,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 14:15:57,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 14:15:57,191 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 14:15:57,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 14:15:57,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 14:15:57,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 14:15:57,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 14:15:57,199 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 14:15:57,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 14:15:57,200 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 14:15:57,201 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 14:15:57,201 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 14:15:57,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 14:15:57,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 14:15:57,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 14:15:57,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 14:15:57,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 14:15:57,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 14:15:57,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 14:15:57,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 14:15:57,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 14:15:57,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 14:15:57,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 14:15:57,207 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 14:15:57,207 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-26 14:15:57,236 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 14:15:57,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 14:15:57,237 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 14:15:57,237 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 14:15:57,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 14:15:57,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 14:15:57,238 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 14:15:57,238 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 14:15:57,238 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 14:15:57,239 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 14:15:57,239 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 14:15:57,239 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 14:15:57,239 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 14:15:57,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 14:15:57,240 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 14:15:57,240 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 14:15:57,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 14:15:57,241 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 14:15:57,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 14:15:57,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 14:15:57,241 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 14:15:57,241 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 14:15:57,241 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 14:15:57,241 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 14:15:57,241 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 14:15:57,241 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 14:15:57,242 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 14:15:57,242 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 14:15:57,242 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 14:15:57,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 14:15:57,242 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 14:15:57,242 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-26 14:15:57,243 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 14:15:57,243 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-26 14:15:57,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 14:15:57,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 14:15:57,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 14:15:57,449 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 14:15:57,463 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 14:15:57,464 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-figure1.wvr.c [2022-07-26 14:15:57,517 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ca40670f/5443697493b942cb884df7a33307460b/FLAGf0f4172cb [2022-07-26 14:15:57,799 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 14:15:57,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure1.wvr.c [2022-07-26 14:15:57,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ca40670f/5443697493b942cb884df7a33307460b/FLAGf0f4172cb [2022-07-26 14:15:58,244 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ca40670f/5443697493b942cb884df7a33307460b [2022-07-26 14:15:58,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 14:15:58,247 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 14:15:58,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 14:15:58,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 14:15:58,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 14:15:58,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:15:58" (1/1) ... [2022-07-26 14:15:58,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10f0138f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:58, skipping insertion in model container [2022-07-26 14:15:58,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:15:58" (1/1) ... [2022-07-26 14:15:58,255 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 14:15:58,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 14:15:58,410 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure1.wvr.c[1991,2004] [2022-07-26 14:15:58,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:15:58,416 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 14:15:58,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure1.wvr.c[1991,2004] [2022-07-26 14:15:58,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:15:58,444 INFO L208 MainTranslator]: Completed translation [2022-07-26 14:15:58,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:58 WrapperNode [2022-07-26 14:15:58,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 14:15:58,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 14:15:58,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 14:15:58,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 14:15:58,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:58" (1/1) ... [2022-07-26 14:15:58,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:58" (1/1) ... [2022-07-26 14:15:58,469 INFO L137 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2022-07-26 14:15:58,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 14:15:58,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 14:15:58,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 14:15:58,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 14:15:58,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:58" (1/1) ... [2022-07-26 14:15:58,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:58" (1/1) ... [2022-07-26 14:15:58,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:58" (1/1) ... [2022-07-26 14:15:58,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:58" (1/1) ... [2022-07-26 14:15:58,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:58" (1/1) ... [2022-07-26 14:15:58,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:58" (1/1) ... [2022-07-26 14:15:58,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:58" (1/1) ... [2022-07-26 14:15:58,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 14:15:58,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 14:15:58,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 14:15:58,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 14:15:58,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:58" (1/1) ... [2022-07-26 14:15:58,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:58,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:58,511 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-26 14:15:58,515 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-26 14:15:58,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 14:15:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-26 14:15:58,545 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-26 14:15:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-26 14:15:58,545 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-26 14:15:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 14:15:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 14:15:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 14:15:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-26 14:15:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-26 14:15:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 14:15:58,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 14:15:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 14:15:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 14:15:58,546 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-26 14:15:58,596 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 14:15:58,597 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 14:15:58,694 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 14:15:58,752 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 14:15:58,752 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-26 14:15:58,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:15:58 BoogieIcfgContainer [2022-07-26 14:15:58,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 14:15:58,755 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 14:15:58,755 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 14:15:58,770 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 14:15:58,770 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:15:58,770 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 02:15:58" (1/3) ... [2022-07-26 14:15:58,771 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69ed763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:15:58, skipping insertion in model container [2022-07-26 14:15:58,771 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:15:58,771 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:58" (2/3) ... [2022-07-26 14:15:58,771 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69ed763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:15:58, skipping insertion in model container [2022-07-26 14:15:58,771 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:15:58,772 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:15:58" (3/3) ... [2022-07-26 14:15:58,772 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-figure1.wvr.c [2022-07-26 14:15:58,853 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-26 14:15:58,887 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 77 transitions, 170 flow [2022-07-26 14:15:58,926 INFO L129 PetriNetUnfolder]: 5/73 cut-off events. [2022-07-26 14:15:58,926 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 14:15:58,929 INFO L84 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 73 events. 5/73 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2022-07-26 14:15:58,929 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 77 transitions, 170 flow [2022-07-26 14:15:58,937 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 73 transitions, 158 flow [2022-07-26 14:15:58,940 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-26 14:15:58,948 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 73 transitions, 158 flow [2022-07-26 14:15:58,952 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 73 transitions, 158 flow [2022-07-26 14:15:58,952 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 73 transitions, 158 flow [2022-07-26 14:15:58,970 INFO L129 PetriNetUnfolder]: 5/73 cut-off events. [2022-07-26 14:15:58,971 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 14:15:58,972 INFO L84 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 73 events. 5/73 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2022-07-26 14:15:58,973 INFO L116 LiptonReduction]: Number of co-enabled transitions 500 [2022-07-26 14:16:00,586 INFO L131 LiptonReduction]: Checked pairs total: 493 [2022-07-26 14:16:00,586 INFO L133 LiptonReduction]: Total number of compositions: 66 [2022-07-26 14:16:00,598 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 14:16:00,598 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 14:16:00,598 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 14:16:00,598 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 14:16:00,598 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 14:16:00,598 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 14:16:00,598 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 14:16:00,599 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 14:16:00,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 14:16:00,620 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-26 14:16:00,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:16:00,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:16:00,624 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-26 14:16:00,624 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:16:00,624 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 14:16:00,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 33 states, but on-demand construction may add more states [2022-07-26 14:16:00,626 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-26 14:16:00,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:16:00,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:16:00,627 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-26 14:16:00,627 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:16:00,630 INFO L733 eck$LassoCheckResult]: Stem: 80#[ULTIMATE.startENTRY]don't care [290] ULTIMATE.startENTRY-->L67-3: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_97| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 1))) (and (= (select |v_#valid_97| 2) 1) (= (select |v_#valid_97| 1) 1) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre6#1_27|))) (= (select |v_#length_58| 1) 2) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_41| 0) (< 0 |v_#StackHeapBarrier_22|) (= 48 (select .cse0 0)) (= (select |v_#valid_97| 0) 0) (= |v_ULTIMATE.start_main_#t~pre6#1_27| |v_#pthreadsForks_36|) (= (select .cse0 1) 0) (= (select |v_#valid_97| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_35| 0) (= (select |v_#length_58| 2) 21) (= |v_#NULL.offset_8| 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_51|) 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_51|) (= (store (store |v_#length_58| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_51| 4) |v_#length_57|) (= |v_#NULL.base_8| 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) (= |v_#valid_96| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_51| 1)) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= v_~counter~0_76 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_44|, #length=|v_#length_58|} OutVars{~counter~0=v_~counter~0_76, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_41|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_13|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_23|, #NULL.offset=|v_#NULL.offset_8|, ~N~0=v_~N~0_35, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|, #NULL.base=|v_#NULL.base_8|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, #valid=|v_#valid_96|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_13|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_24|, #length=|v_#length_57|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|} AuxVars[] AssignedVars[~counter~0, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~pre8#1, #NULL.offset, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem10#1, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem11#1, #length, ULTIMATE.start_main_~#t2~0#1.base] 83#[L67-3]don't care [223] L67-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_12, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 85#[thread1ENTRY, L67-4]don't care [198] thread1ENTRY-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 87#[L67-4, L41-4]don't care [2022-07-26 14:16:00,630 INFO L735 eck$LassoCheckResult]: Loop: 87#[L67-4, L41-4]don't care [279] L41-4-->L41-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_26 v_~N~0_27) (= v_thread1Thread1of1ForFork1_~i~0_25 (+ v_thread1Thread1of1ForFork1_~i~0_26 1)) (= (+ v_~counter~0_67 1) v_~counter~0_66)) InVars {~counter~0=v_~counter~0_67, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_26, ~N~0=v_~N~0_27} OutVars{~counter~0=v_~counter~0_66, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_19|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, ~N~0=v_~N~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 87#[L67-4, L41-4]don't care [2022-07-26 14:16:00,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:16:00,633 INFO L85 PathProgramCache]: Analyzing trace with hash 315592, now seen corresponding path program 1 times [2022-07-26 14:16:00,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:16:00,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162436777] [2022-07-26 14:16:00,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:16:00,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:16:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:16:00,702 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:16:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:16:00,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:16:00,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:16:00,727 INFO L85 PathProgramCache]: Analyzing trace with hash 310, now seen corresponding path program 1 times [2022-07-26 14:16:00,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:16:00,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046435726] [2022-07-26 14:16:00,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:16:00,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:16:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:16:00,732 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:16:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:16:00,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:16:00,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:16:00,735 INFO L85 PathProgramCache]: Analyzing trace with hash 9783631, now seen corresponding path program 1 times [2022-07-26 14:16:00,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:16:00,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275876337] [2022-07-26 14:16:00,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:16:00,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:16:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:16:00,747 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:16:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:16:00,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:16:00,789 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:16:00,789 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:16:00,789 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:16:00,789 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:16:00,790 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-26 14:16:00,790 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:00,790 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:16:00,790 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:16:00,790 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1.wvr.c_BEv2_Iteration1_Loop [2022-07-26 14:16:00,790 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:16:00,790 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:16:00,801 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:00,805 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:00,807 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:00,809 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:00,811 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:00,812 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:00,814 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:00,815 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:00,860 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:16:00,860 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-26 14:16:00,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:00,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:00,874 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-26 14:16:00,878 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-26 14:16:00,878 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-26 14:16:00,879 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 14:16:00,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-26 14:16:00,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:00,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:00,911 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-26 14:16:00,911 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-26 14:16:00,913 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-26 14:16:00,913 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 14:16:00,935 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-26 14:16:00,935 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~counter~0=0} Honda state: {~counter~0=0} Generalized eigenvectors: [{~counter~0=-6}, {~counter~0=6}, {~counter~0=1}] Lambdas: [2, 1, 1] Nus: [1, 0] [2022-07-26 14:16:00,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-26 14:16:00,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:00,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:00,973 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-26 14:16:00,974 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-26 14:16:00,975 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-26 14:16:00,976 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 14:16:00,999 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-26 14:16:01,000 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_1=1} Honda state: {v_rep#funAddr~thread2.offset_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-26 14:16:01,021 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-26 14:16:01,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:01,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:01,022 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-26 14:16:01,023 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-26 14:16:01,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-26 14:16:01,025 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 14:16:01,036 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-26 14:16:01,036 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_1=-1} Honda state: {v_rep#funAddr~thread1.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-26 14:16:01,051 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-26 14:16:01,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:01,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:01,053 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-26 14:16:01,054 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-26 14:16:01,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-26 14:16:01,058 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 14:16:01,069 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-26 14:16:01,069 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_1=0} Honda state: {v_rep#funAddr~thread1.offset_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-26 14:16:01,085 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-26 14:16:01,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:01,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:01,086 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-26 14:16:01,087 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-26 14:16:01,088 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-26 14:16:01,088 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 14:16:01,094 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-26 14:16:01,094 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~post2=0} Honda state: {thread1Thread1of1ForFork1_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-26 14:16:01,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-26 14:16:01,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:01,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:01,110 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-26 14:16:01,111 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-26 14:16:01,112 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-26 14:16:01,113 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 14:16:01,123 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-26 14:16:01,123 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_1=-1} Honda state: {v_rep#funAddr~thread2.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-26 14:16:01,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-26 14:16:01,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:01,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:01,140 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-26 14:16:01,141 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-26 14:16:01,142 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-26 14:16:01,142 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 14:16:01,159 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-26 14:16:01,159 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~post1=0} Honda state: {thread1Thread1of1ForFork1_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-26 14:16:01,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-26 14:16:01,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:01,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:01,177 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-26 14:16:01,178 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-26 14:16:01,178 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-26 14:16:01,178 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 14:16:01,201 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-26 14:16:01,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:01,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:01,202 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-26 14:16:01,205 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-26 14:16:01,206 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-26 14:16:01,206 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 14:16:01,317 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-26 14:16:01,320 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-26 14:16:01,321 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:16:01,321 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:16:01,321 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:16:01,321 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:16:01,321 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:16:01,321 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:01,321 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:16:01,321 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:16:01,321 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1.wvr.c_BEv2_Iteration1_Loop [2022-07-26 14:16:01,321 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:16:01,321 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:16:01,322 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:01,326 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:01,329 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:01,331 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:01,333 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:01,335 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:01,336 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:01,338 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:01,402 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:16:01,405 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:16:01,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:01,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:01,407 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-26 14:16:01,408 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-26 14:16:01,409 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-26 14:16:01,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:16:01,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:16:01,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:16:01,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:16:01,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:16:01,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:16:01,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:16:01,433 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:16:01,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-26 14:16:01,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:01,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:01,450 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-26 14:16:01,461 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-26 14:16:01,462 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-26 14:16:01,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:16:01,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:16:01,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:16:01,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:16:01,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:16:01,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:16:01,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:16:01,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-07-26 14:16:01,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:01,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:01,505 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-26 14:16:01,506 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-26 14:16:01,512 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-26 14:16:01,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:16:01,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:16:01,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:16:01,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:16:01,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:16:01,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:16:01,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:16:01,548 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-26 14:16:01,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:01,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:01,553 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-26 14:16:01,554 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-26 14:16:01,555 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-26 14:16:01,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:16:01,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:16:01,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:16:01,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:16:01,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:16:01,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:16:01,599 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:16:01,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-26 14:16:01,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:01,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:01,616 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-26 14:16:01,617 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-26 14:16:01,649 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-26 14:16:01,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:16:01,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:16:01,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:16:01,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:16:01,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:16:01,656 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:16:01,656 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:16:01,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:16:01,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-07-26 14:16:01,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:01,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:01,673 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-26 14:16:01,673 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-26 14:16:01,675 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-26 14:16:01,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:16:01,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:16:01,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:16:01,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:16:01,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:16:01,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:16:01,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:16:01,723 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-26 14:16:01,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:01,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:01,744 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-26 14:16:01,746 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-26 14:16:01,747 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-26 14:16:01,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:16:01,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:16:01,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:16:01,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:16:01,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:16:01,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:16:01,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:16:01,770 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:16:01,786 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-26 14:16:01,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:01,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:01,789 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-26 14:16:01,789 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-26 14:16:01,794 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-26 14:16:01,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:16:01,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:16:01,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:16:01,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:16:01,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:16:01,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:16:01,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:16:01,814 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:16:01,817 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-26 14:16:01,818 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-26 14:16:01,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:01,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:01,820 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-26 14:16:01,822 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-26 14:16:01,822 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:16:01,823 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-26 14:16:01,823 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:16:01,823 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~i~0, ~N~0) = -1*thread1Thread1of1ForFork1_~i~0 + 1*~N~0 Supporting invariants [] [2022-07-26 14:16:01,839 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-26 14:16:01,841 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-26 14:16:01,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:16:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:16:01,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:16:01,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:16:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:16:01,887 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:16:01,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:16:01,888 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-26 14:16:01,906 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:16:01,907 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 33 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-26 14:16:01,956 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 33 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 84 states and 231 transitions. Complement of second has 5 states. [2022-07-26 14:16:01,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:16:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-26 14:16:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-07-26 14:16:01,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 3 letters. Loop has 1 letters. [2022-07-26 14:16:01,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:16:01,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 4 letters. Loop has 1 letters. [2022-07-26 14:16:01,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:16:01,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 3 letters. Loop has 2 letters. [2022-07-26 14:16:01,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:16:01,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 231 transitions. [2022-07-26 14:16:01,968 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2022-07-26 14:16:01,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 49 states and 131 transitions. [2022-07-26 14:16:01,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-07-26 14:16:01,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-07-26 14:16:01,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 131 transitions. [2022-07-26 14:16:01,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:16:01,974 INFO L220 hiAutomatonCegarLoop]: Abstraction has 49 states and 131 transitions. [2022-07-26 14:16:01,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 131 transitions. [2022-07-26 14:16:01,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2022-07-26 14:16:01,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.8) internal successors, (112), 39 states have internal predecessors, (112), 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-26 14:16:01,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 112 transitions. [2022-07-26 14:16:01,993 INFO L242 hiAutomatonCegarLoop]: Abstraction has 40 states and 112 transitions. [2022-07-26 14:16:01,993 INFO L426 stractBuchiCegarLoop]: Abstraction has 40 states and 112 transitions. [2022-07-26 14:16:01,993 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 14:16:01,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 112 transitions. [2022-07-26 14:16:01,994 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2022-07-26 14:16:01,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:16:01,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:16:01,995 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-26 14:16:01,995 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:16:01,995 INFO L733 eck$LassoCheckResult]: Stem: 274#[ULTIMATE.startENTRY]don't care [290] ULTIMATE.startENTRY-->L67-3: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_97| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 1))) (and (= (select |v_#valid_97| 2) 1) (= (select |v_#valid_97| 1) 1) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre6#1_27|))) (= (select |v_#length_58| 1) 2) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_41| 0) (< 0 |v_#StackHeapBarrier_22|) (= 48 (select .cse0 0)) (= (select |v_#valid_97| 0) 0) (= |v_ULTIMATE.start_main_#t~pre6#1_27| |v_#pthreadsForks_36|) (= (select .cse0 1) 0) (= (select |v_#valid_97| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_35| 0) (= (select |v_#length_58| 2) 21) (= |v_#NULL.offset_8| 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_51|) 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_51|) (= (store (store |v_#length_58| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_51| 4) |v_#length_57|) (= |v_#NULL.base_8| 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) (= |v_#valid_96| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_51| 1)) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= v_~counter~0_76 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_44|, #length=|v_#length_58|} OutVars{~counter~0=v_~counter~0_76, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_41|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_13|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_23|, #NULL.offset=|v_#NULL.offset_8|, ~N~0=v_~N~0_35, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|, #NULL.base=|v_#NULL.base_8|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, #valid=|v_#valid_96|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_13|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_24|, #length=|v_#length_57|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|} AuxVars[] AssignedVars[~counter~0, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~pre8#1, #NULL.offset, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem10#1, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem11#1, #length, ULTIMATE.start_main_~#t2~0#1.base] 276#[L67-3]don't care [223] L67-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_12, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 332#[thread1ENTRY, L67-4]don't care [280] L67-4-->L68-3: Formula: (and (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) 1) (= (store |v_#memory_int_34| |v_ULTIMATE.start_main_~#t2~0#1.base_33| (store (select |v_#memory_int_34| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre8#1_19|)) |v_#memory_int_33|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (= |v_ULTIMATE.start_main_#t~pre8#1_19| |v_#pthreadsForks_28|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_33|))) InVars {#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_34|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_21|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_74|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_9|, #memory_int=|v_#memory_int_33|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_19|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~pre8#1] 278#[L68-3, thread1ENTRY]don't care [220] L68-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre8#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_12|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_8|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork0_#t~post4#1] 282#[thread1ENTRY, thread2ENTRY, L68-4]don't care [208] thread2ENTRY-->L51-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 314#[thread1ENTRY, L51-4, L68-4]don't care [2022-07-26 14:16:01,995 INFO L735 eck$LassoCheckResult]: Loop: 314#[thread1ENTRY, L51-4, L68-4]don't care [281] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 v_~counter~0_71) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~counter~0_71 (+ v_~counter~0_70 1)) (< |v_thread2Thread1of1ForFork0_~i~1#1_28| v_~N~0_29) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_28| 1) |v_thread2Thread1of1ForFork0_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0))) InVars {~counter~0=v_~counter~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_28|, ~N~0=v_~N~0_29} OutVars{~counter~0=v_~counter~0_70, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_27|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N~0=v_~N~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_7|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork0_#t~post4#1] 314#[thread1ENTRY, L51-4, L68-4]don't care [2022-07-26 14:16:01,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:16:01,996 INFO L85 PathProgramCache]: Analyzing trace with hash 303369742, now seen corresponding path program 1 times [2022-07-26 14:16:01,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:16:01,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349567408] [2022-07-26 14:16:01,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:16:01,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:16:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:16:02,008 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:16:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:16:02,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:16:02,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:16:02,021 INFO L85 PathProgramCache]: Analyzing trace with hash 312, now seen corresponding path program 1 times [2022-07-26 14:16:02,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:16:02,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789775106] [2022-07-26 14:16:02,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:16:02,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:16:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:16:02,026 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:16:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:16:02,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:16:02,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:16:02,031 INFO L85 PathProgramCache]: Analyzing trace with hash 814527691, now seen corresponding path program 1 times [2022-07-26 14:16:02,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:16:02,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120018712] [2022-07-26 14:16:02,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:16:02,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:16:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:16:02,077 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-26 14:16:02,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:16:02,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120018712] [2022-07-26 14:16:02,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120018712] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:16:02,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:16:02,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-26 14:16:02,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666226071] [2022-07-26 14:16:02,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:16:02,119 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:16:02,119 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:16:02,119 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:16:02,119 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:16:02,119 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-26 14:16:02,119 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:02,119 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:16:02,119 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:16:02,119 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1.wvr.c_BEv2_Iteration2_Loop [2022-07-26 14:16:02,119 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:16:02,120 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:16:02,120 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,124 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,126 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,127 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,129 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,131 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,135 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,137 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,140 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,196 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:16:02,196 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-26 14:16:02,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:02,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:02,205 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-26 14:16:02,206 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-26 14:16:02,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-26 14:16:02,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 14:16:02,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-26 14:16:02,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:02,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:02,247 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-26 14:16:02,248 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-26 14:16:02,292 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-26 14:16:02,292 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 14:16:02,318 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-26 14:16:02,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-26 14:16:02,322 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:16:02,322 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:16:02,322 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:16:02,322 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:16:02,322 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:16:02,322 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:02,322 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:16:02,322 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:16:02,322 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1.wvr.c_BEv2_Iteration2_Loop [2022-07-26 14:16:02,323 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:16:02,323 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:16:02,324 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,343 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,346 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,347 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,349 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,350 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,353 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,360 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,361 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,408 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:16:02,408 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:16:02,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:02,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:02,410 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:16:02,440 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-26 14:16:02,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:16:02,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:16:02,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:16:02,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:16:02,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:16:02,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:16:02,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:16:02,451 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-26 14:16:02,459 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:16:02,462 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-26 14:16:02,462 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-26 14:16:02,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:02,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:02,472 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-26 14:16:02,474 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:16:02,474 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-26 14:16:02,474 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:16:02,474 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~counter~0) = 1*~counter~0 Supporting invariants [] [2022-07-26 14:16:02,492 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-26 14:16:02,494 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-26 14:16:02,494 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-26 14:16:02,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:16:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:16:02,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:16:02,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:16:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:16:02,529 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-26 14:16:02,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:16:02,530 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-26 14:16:02,530 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:16:02,531 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 112 transitions. cyclomatic complexity: 86 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-26 14:16:02,552 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 112 transitions. cyclomatic complexity: 86. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 84 states and 211 transitions. Complement of second has 5 states. [2022-07-26 14:16:02,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:16:02,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-26 14:16:02,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-07-26 14:16:02,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-26 14:16:02,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:16:02,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-26 14:16:02,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:16:02,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-26 14:16:02,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:16:02,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 211 transitions. [2022-07-26 14:16:02,556 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2022-07-26 14:16:02,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 48 states and 115 transitions. [2022-07-26 14:16:02,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-26 14:16:02,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-26 14:16:02,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 115 transitions. [2022-07-26 14:16:02,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:16:02,557 INFO L220 hiAutomatonCegarLoop]: Abstraction has 48 states and 115 transitions. [2022-07-26 14:16:02,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 115 transitions. [2022-07-26 14:16:02,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2022-07-26 14:16:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.388888888888889) internal successors, (86), 35 states have internal predecessors, (86), 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-26 14:16:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 86 transitions. [2022-07-26 14:16:02,559 INFO L242 hiAutomatonCegarLoop]: Abstraction has 36 states and 86 transitions. [2022-07-26 14:16:02,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:16:02,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 14:16:02,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 14:16:02,562 INFO L87 Difference]: Start difference. First operand 36 states and 86 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-26 14:16:02,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:16:02,579 INFO L93 Difference]: Finished difference Result 41 states and 86 transitions. [2022-07-26 14:16:02,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 86 transitions. [2022-07-26 14:16:02,580 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2022-07-26 14:16:02,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 38 states and 80 transitions. [2022-07-26 14:16:02,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-26 14:16:02,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-26 14:16:02,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 80 transitions. [2022-07-26 14:16:02,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:16:02,580 INFO L220 hiAutomatonCegarLoop]: Abstraction has 38 states and 80 transitions. [2022-07-26 14:16:02,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 80 transitions. [2022-07-26 14:16:02,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-07-26 14:16:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 34 states have internal predecessors, (76), 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-26 14:16:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 76 transitions. [2022-07-26 14:16:02,584 INFO L242 hiAutomatonCegarLoop]: Abstraction has 35 states and 76 transitions. [2022-07-26 14:16:02,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 14:16:02,584 INFO L426 stractBuchiCegarLoop]: Abstraction has 35 states and 76 transitions. [2022-07-26 14:16:02,585 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 14:16:02,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 76 transitions. [2022-07-26 14:16:02,585 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2022-07-26 14:16:02,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:16:02,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:16:02,585 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:16:02,585 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:16:02,586 INFO L733 eck$LassoCheckResult]: Stem: 591#[ULTIMATE.startENTRY]don't care [290] ULTIMATE.startENTRY-->L67-3: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_97| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 1))) (and (= (select |v_#valid_97| 2) 1) (= (select |v_#valid_97| 1) 1) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre6#1_27|))) (= (select |v_#length_58| 1) 2) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_41| 0) (< 0 |v_#StackHeapBarrier_22|) (= 48 (select .cse0 0)) (= (select |v_#valid_97| 0) 0) (= |v_ULTIMATE.start_main_#t~pre6#1_27| |v_#pthreadsForks_36|) (= (select .cse0 1) 0) (= (select |v_#valid_97| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_35| 0) (= (select |v_#length_58| 2) 21) (= |v_#NULL.offset_8| 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_51|) 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_51|) (= (store (store |v_#length_58| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_51| 4) |v_#length_57|) (= |v_#NULL.base_8| 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) (= |v_#valid_96| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_51| 1)) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= v_~counter~0_76 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_44|, #length=|v_#length_58|} OutVars{~counter~0=v_~counter~0_76, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_41|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_13|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_23|, #NULL.offset=|v_#NULL.offset_8|, ~N~0=v_~N~0_35, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|, #NULL.base=|v_#NULL.base_8|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, #valid=|v_#valid_96|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_13|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_24|, #length=|v_#length_57|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|} AuxVars[] AssignedVars[~counter~0, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~pre8#1, #NULL.offset, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem10#1, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem11#1, #length, ULTIMATE.start_main_~#t2~0#1.base] 593#[L67-3]don't care [223] L67-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_12, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 635#[thread1ENTRY, L67-4]don't care [198] thread1ENTRY-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 603#[L67-4, L41-4]don't care [280] L67-4-->L68-3: Formula: (and (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) 1) (= (store |v_#memory_int_34| |v_ULTIMATE.start_main_~#t2~0#1.base_33| (store (select |v_#memory_int_34| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre8#1_19|)) |v_#memory_int_33|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (= |v_ULTIMATE.start_main_#t~pre8#1_19| |v_#pthreadsForks_28|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_33|))) InVars {#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_34|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_21|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_74|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_9|, #memory_int=|v_#memory_int_33|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_19|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~pre8#1] 607#[L68-3, L41-4]don't care [220] L68-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre8#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_12|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_8|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork0_#t~post4#1] 627#[thread2ENTRY, L68-4, L41-4]don't care [208] thread2ENTRY-->L51-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 617#[L41-4, L51-4, L68-4]don't care [279] L41-4-->L41-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_26 v_~N~0_27) (= v_thread1Thread1of1ForFork1_~i~0_25 (+ v_thread1Thread1of1ForFork1_~i~0_26 1)) (= (+ v_~counter~0_67 1) v_~counter~0_66)) InVars {~counter~0=v_~counter~0_67, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_26, ~N~0=v_~N~0_27} OutVars{~counter~0=v_~counter~0_66, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_19|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, ~N~0=v_~N~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 619#[L41-4, L51-4, L68-4]don't care [281] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 v_~counter~0_71) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~counter~0_71 (+ v_~counter~0_70 1)) (< |v_thread2Thread1of1ForFork0_~i~1#1_28| v_~N~0_29) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_28| 1) |v_thread2Thread1of1ForFork0_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0))) InVars {~counter~0=v_~counter~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_28|, ~N~0=v_~N~0_29} OutVars{~counter~0=v_~counter~0_70, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_27|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N~0=v_~N~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_7|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork0_#t~post4#1] 611#[L41-4, L51-4, L68-4]don't care [2022-07-26 14:16:02,586 INFO L735 eck$LassoCheckResult]: Loop: 611#[L41-4, L51-4, L68-4]don't care [281] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 v_~counter~0_71) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~counter~0_71 (+ v_~counter~0_70 1)) (< |v_thread2Thread1of1ForFork0_~i~1#1_28| v_~N~0_29) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_28| 1) |v_thread2Thread1of1ForFork0_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0))) InVars {~counter~0=v_~counter~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_28|, ~N~0=v_~N~0_29} OutVars{~counter~0=v_~counter~0_70, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_27|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N~0=v_~N~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_7|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork0_#t~post4#1] 611#[L41-4, L51-4, L68-4]don't care [2022-07-26 14:16:02,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:16:02,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1214819674, now seen corresponding path program 1 times [2022-07-26 14:16:02,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:16:02,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390521637] [2022-07-26 14:16:02,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:16:02,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:16:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:16:02,614 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:16:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:16:02,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:16:02,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:16:02,636 INFO L85 PathProgramCache]: Analyzing trace with hash 312, now seen corresponding path program 2 times [2022-07-26 14:16:02,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:16:02,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777576293] [2022-07-26 14:16:02,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:16:02,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:16:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:16:02,639 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:16:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:16:02,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:16:02,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:16:02,649 INFO L85 PathProgramCache]: Analyzing trace with hash 995296051, now seen corresponding path program 2 times [2022-07-26 14:16:02,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:16:02,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172912542] [2022-07-26 14:16:02,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:16:02,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:16:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:16:02,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:16:02,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:16:02,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172912542] [2022-07-26 14:16:02,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172912542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:16:02,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:16:02,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 14:16:02,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408725812] [2022-07-26 14:16:02,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:16:02,752 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:16:02,752 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:16:02,752 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:16:02,752 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:16:02,752 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-26 14:16:02,752 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:02,752 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:16:02,753 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:16:02,753 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1.wvr.c_BEv2_Iteration3_Loop [2022-07-26 14:16:02,753 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:16:02,753 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:16:02,753 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,755 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,756 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,759 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,761 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,764 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,766 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,769 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,772 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,826 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:16:02,826 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-26 14:16:02,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:02,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:02,827 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-26 14:16:02,828 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-26 14:16:02,830 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-26 14:16:02,830 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 14:16:02,847 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-26 14:16:02,848 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_#t~post4#1=0} Honda state: {thread2Thread1of1ForFork0_#t~post4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-26 14:16:02,863 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-26 14:16:02,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:02,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:02,865 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-26 14:16:02,866 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-26 14:16:02,867 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-26 14:16:02,867 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 14:16:02,888 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-26 14:16:02,888 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_5=-1} Honda state: {v_rep#funAddr~thread1.base_5=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-26 14:16:02,906 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-26 14:16:02,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:02,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:02,908 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-26 14:16:02,909 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-26 14:16:02,910 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-26 14:16:02,910 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 14:16:02,948 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-26 14:16:02,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:02,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:02,950 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-26 14:16:02,952 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-26 14:16:02,953 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-26 14:16:02,953 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 14:16:02,982 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-26 14:16:02,987 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-26 14:16:02,987 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:16:02,987 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:16:02,988 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:16:02,988 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:16:02,988 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:16:02,988 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:02,988 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:16:02,988 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:16:02,988 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1.wvr.c_BEv2_Iteration3_Loop [2022-07-26 14:16:02,988 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:16:02,988 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:16:02,989 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,991 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,993 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,994 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:02,997 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,000 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,002 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,005 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,007 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,068 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:16:03,069 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:16:03,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:03,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:03,070 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-26 14:16:03,072 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-26 14:16:03,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:16:03,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:16:03,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:16:03,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:16:03,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:16:03,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:16:03,083 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-26 14:16:03,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:16:03,107 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-26 14:16:03,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:03,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:03,108 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-26 14:16:03,109 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-26 14:16:03,111 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-26 14:16:03,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:16:03,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:16:03,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:16:03,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:16:03,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:16:03,117 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:16:03,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:16:03,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:16:03,165 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-26 14:16:03,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:03,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:03,166 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-26 14:16:03,169 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-26 14:16:03,170 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-26 14:16:03,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:16:03,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:16:03,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:16:03,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:16:03,178 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:16:03,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:16:03,194 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:16:03,211 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-26 14:16:03,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:03,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:03,213 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-26 14:16:03,214 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-26 14:16:03,215 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-26 14:16:03,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:16:03,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:16:03,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:16:03,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:16:03,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:16:03,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:16:03,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:16:03,238 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:16:03,240 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-07-26 14:16:03,240 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-26 14:16:03,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:03,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:03,243 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-26 14:16:03,245 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-26 14:16:03,246 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:16:03,246 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-26 14:16:03,246 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:16:03,246 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~counter~0) = 1*~counter~0 Supporting invariants [] [2022-07-26 14:16:03,263 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-26 14:16:03,264 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-26 14:16:03,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:16:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:16:03,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:16:03,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:16:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:16:03,301 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-26 14:16:03,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:16:03,301 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-26 14:16:03,302 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:16:03,302 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 76 transitions. cyclomatic complexity: 54 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-26 14:16:03,329 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 76 transitions. cyclomatic complexity: 54. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 77 states and 164 transitions. Complement of second has 5 states. [2022-07-26 14:16:03,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:16:03,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-26 14:16:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-07-26 14:16:03,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-26 14:16:03,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:16:03,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 9 letters. Loop has 1 letters. [2022-07-26 14:16:03,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:16:03,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-26 14:16:03,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:16:03,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 164 transitions. [2022-07-26 14:16:03,335 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2022-07-26 14:16:03,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 45 states and 97 transitions. [2022-07-26 14:16:03,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-26 14:16:03,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-26 14:16:03,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 97 transitions. [2022-07-26 14:16:03,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:16:03,336 INFO L220 hiAutomatonCegarLoop]: Abstraction has 45 states and 97 transitions. [2022-07-26 14:16:03,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 97 transitions. [2022-07-26 14:16:03,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2022-07-26 14:16:03,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 38 states have internal predecessors, (86), 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-26 14:16:03,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 86 transitions. [2022-07-26 14:16:03,339 INFO L242 hiAutomatonCegarLoop]: Abstraction has 39 states and 86 transitions. [2022-07-26 14:16:03,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:16:03,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 14:16:03,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-26 14:16:03,339 INFO L87 Difference]: Start difference. First operand 39 states and 86 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-26 14:16:03,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:16:03,369 INFO L93 Difference]: Finished difference Result 68 states and 141 transitions. [2022-07-26 14:16:03,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 141 transitions. [2022-07-26 14:16:03,371 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2022-07-26 14:16:03,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 56 states and 120 transitions. [2022-07-26 14:16:03,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-26 14:16:03,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-26 14:16:03,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 120 transitions. [2022-07-26 14:16:03,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:16:03,372 INFO L220 hiAutomatonCegarLoop]: Abstraction has 56 states and 120 transitions. [2022-07-26 14:16:03,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 120 transitions. [2022-07-26 14:16:03,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-07-26 14:16:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.1923076923076925) internal successors, (114), 51 states have internal predecessors, (114), 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-26 14:16:03,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 114 transitions. [2022-07-26 14:16:03,383 INFO L242 hiAutomatonCegarLoop]: Abstraction has 52 states and 114 transitions. [2022-07-26 14:16:03,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-26 14:16:03,386 INFO L426 stractBuchiCegarLoop]: Abstraction has 52 states and 114 transitions. [2022-07-26 14:16:03,386 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-26 14:16:03,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 114 transitions. [2022-07-26 14:16:03,387 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2022-07-26 14:16:03,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:16:03,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:16:03,389 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-07-26 14:16:03,389 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:16:03,389 INFO L733 eck$LassoCheckResult]: Stem: 930#[ULTIMATE.startENTRY]don't care [290] ULTIMATE.startENTRY-->L67-3: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_97| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 1))) (and (= (select |v_#valid_97| 2) 1) (= (select |v_#valid_97| 1) 1) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre6#1_27|))) (= (select |v_#length_58| 1) 2) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_41| 0) (< 0 |v_#StackHeapBarrier_22|) (= 48 (select .cse0 0)) (= (select |v_#valid_97| 0) 0) (= |v_ULTIMATE.start_main_#t~pre6#1_27| |v_#pthreadsForks_36|) (= (select .cse0 1) 0) (= (select |v_#valid_97| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_35| 0) (= (select |v_#length_58| 2) 21) (= |v_#NULL.offset_8| 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_51|) 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_51|) (= (store (store |v_#length_58| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_51| 4) |v_#length_57|) (= |v_#NULL.base_8| 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) (= |v_#valid_96| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_51| 1)) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= v_~counter~0_76 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_44|, #length=|v_#length_58|} OutVars{~counter~0=v_~counter~0_76, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_41|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_13|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_23|, #NULL.offset=|v_#NULL.offset_8|, ~N~0=v_~N~0_35, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|, #NULL.base=|v_#NULL.base_8|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_24|, #valid=|v_#valid_96|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_13|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_24|, #length=|v_#length_57|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|} AuxVars[] AssignedVars[~counter~0, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~pre8#1, #NULL.offset, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem10#1, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem11#1, #length, ULTIMATE.start_main_~#t2~0#1.base] 932#[L67-3]don't care [223] L67-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_12, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 974#[thread1ENTRY, L67-4]don't care [198] thread1ENTRY-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 942#[L67-4, L41-4]don't care [279] L41-4-->L41-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_26 v_~N~0_27) (= v_thread1Thread1of1ForFork1_~i~0_25 (+ v_thread1Thread1of1ForFork1_~i~0_26 1)) (= (+ v_~counter~0_67 1) v_~counter~0_66)) InVars {~counter~0=v_~counter~0_67, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_26, ~N~0=v_~N~0_27} OutVars{~counter~0=v_~counter~0_66, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_19|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, ~N~0=v_~N~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 944#[L67-4, L41-4]don't care [279] L41-4-->L41-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_26 v_~N~0_27) (= v_thread1Thread1of1ForFork1_~i~0_25 (+ v_thread1Thread1of1ForFork1_~i~0_26 1)) (= (+ v_~counter~0_67 1) v_~counter~0_66)) InVars {~counter~0=v_~counter~0_67, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_26, ~N~0=v_~N~0_27} OutVars{~counter~0=v_~counter~0_66, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_19|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, ~N~0=v_~N~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 948#[L67-4, L41-4]don't care [280] L67-4-->L68-3: Formula: (and (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) 1) (= (store |v_#memory_int_34| |v_ULTIMATE.start_main_~#t2~0#1.base_33| (store (select |v_#memory_int_34| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre8#1_19|)) |v_#memory_int_33|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (= |v_ULTIMATE.start_main_#t~pre8#1_19| |v_#pthreadsForks_28|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_33|))) InVars {#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_34|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_21|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_74|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_9|, #memory_int=|v_#memory_int_33|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_19|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~pre8#1] 1020#[L68-3, L41-4]don't care [220] L68-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre8#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_12|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_8|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork0_#t~post4#1] 1012#[thread2ENTRY, L68-4, L41-4]don't care [208] thread2ENTRY-->L51-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 1002#[L41-4, L51-4, L68-4]don't care [281] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 v_~counter~0_71) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~counter~0_71 (+ v_~counter~0_70 1)) (< |v_thread2Thread1of1ForFork0_~i~1#1_28| v_~N~0_29) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_28| 1) |v_thread2Thread1of1ForFork0_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0))) InVars {~counter~0=v_~counter~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_28|, ~N~0=v_~N~0_29} OutVars{~counter~0=v_~counter~0_70, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_27|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N~0=v_~N~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_7|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork0_#t~post4#1] 1006#[L41-4, L51-4, L68-4]don't care [279] L41-4-->L41-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_26 v_~N~0_27) (= v_thread1Thread1of1ForFork1_~i~0_25 (+ v_thread1Thread1of1ForFork1_~i~0_26 1)) (= (+ v_~counter~0_67 1) v_~counter~0_66)) InVars {~counter~0=v_~counter~0_67, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_26, ~N~0=v_~N~0_27} OutVars{~counter~0=v_~counter~0_66, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_19|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, ~N~0=v_~N~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 990#[L41-4, L51-4, L68-4]don't care [281] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 v_~counter~0_71) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~counter~0_71 (+ v_~counter~0_70 1)) (< |v_thread2Thread1of1ForFork0_~i~1#1_28| v_~N~0_29) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_28| 1) |v_thread2Thread1of1ForFork0_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0))) InVars {~counter~0=v_~counter~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_28|, ~N~0=v_~N~0_29} OutVars{~counter~0=v_~counter~0_70, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_27|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N~0=v_~N~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_7|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork0_#t~post4#1] 952#[L41-4, L51-4, L68-4]don't care [2022-07-26 14:16:03,390 INFO L735 eck$LassoCheckResult]: Loop: 952#[L41-4, L51-4, L68-4]don't care [281] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 v_~counter~0_71) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= v_~counter~0_71 (+ v_~counter~0_70 1)) (< |v_thread2Thread1of1ForFork0_~i~1#1_28| v_~N~0_29) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_28| 1) |v_thread2Thread1of1ForFork0_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0))) InVars {~counter~0=v_~counter~0_71, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_28|, ~N~0=v_~N~0_29} OutVars{~counter~0=v_~counter~0_70, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_27|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N~0=v_~N~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_7|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork0_#t~post4#1] 952#[L41-4, L51-4, L68-4]don't care [2022-07-26 14:16:03,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:16:03,390 INFO L85 PathProgramCache]: Analyzing trace with hash -213257385, now seen corresponding path program 3 times [2022-07-26 14:16:03,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:16:03,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791826456] [2022-07-26 14:16:03,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:16:03,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:16:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:16:03,421 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:16:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:16:03,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:16:03,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:16:03,440 INFO L85 PathProgramCache]: Analyzing trace with hash 312, now seen corresponding path program 3 times [2022-07-26 14:16:03,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:16:03,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599975969] [2022-07-26 14:16:03,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:16:03,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:16:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:16:03,446 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:16:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:16:03,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:16:03,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:16:03,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1978955938, now seen corresponding path program 4 times [2022-07-26 14:16:03,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:16:03,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533602147] [2022-07-26 14:16:03,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:16:03,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:16:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:16:03,458 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:16:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:16:03,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:16:03,493 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:16:03,493 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:16:03,493 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:16:03,493 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:16:03,493 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-26 14:16:03,494 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:03,494 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:16:03,494 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:16:03,494 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1.wvr.c_BEv2_Iteration4_Loop [2022-07-26 14:16:03,494 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:16:03,494 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:16:03,494 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,512 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,514 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,517 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,520 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,523 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,525 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,526 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,528 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,578 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:16:03,579 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-26 14:16:03,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:03,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:03,580 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-26 14:16:03,581 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-26 14:16:03,583 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-26 14:16:03,583 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 14:16:03,603 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-26 14:16:03,604 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_7=-1} Honda state: {v_rep#funAddr~thread2.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-26 14:16:03,619 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-26 14:16:03,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:03,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:03,621 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-26 14:16:03,621 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-26 14:16:03,641 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-26 14:16:03,641 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 14:16:03,652 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-26 14:16:03,652 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_7=-1} Honda state: {v_rep#funAddr~thread1.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-26 14:16:03,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-26 14:16:03,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:03,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:03,669 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-26 14:16:03,670 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-26 14:16:03,671 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-26 14:16:03,671 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 14:16:03,688 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-26 14:16:03,688 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=1} Honda state: {thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-26 14:16:03,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-26 14:16:03,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:03,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:03,705 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-26 14:16:03,705 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-26 14:16:03,707 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-26 14:16:03,707 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 14:16:03,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-26 14:16:03,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:03,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:03,768 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-26 14:16:03,769 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-26 14:16:03,770 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-26 14:16:03,771 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 14:16:03,795 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-26 14:16:03,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-26 14:16:03,798 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:16:03,799 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:16:03,799 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:16:03,799 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:16:03,799 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:16:03,799 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:03,799 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:16:03,799 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:16:03,799 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1.wvr.c_BEv2_Iteration4_Loop [2022-07-26 14:16:03,799 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:16:03,799 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:16:03,800 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,803 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,808 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,816 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,818 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,822 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,829 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,831 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,832 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:16:03,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-26 14:16:03,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-26 14:16:03,946 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:16:03,946 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:16:03,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:03,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:03,947 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-26 14:16:03,948 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-26 14:16:03,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-26 14:16:03,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:16:03,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:16:03,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:16:03,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:16:03,957 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:16:03,957 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:16:03,969 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-26 14:16:03,973 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:16:03,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-26 14:16:03,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:03,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:03,990 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-26 14:16:03,991 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-26 14:16:03,992 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-26 14:16:03,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:16:03,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:16:03,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:16:03,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:16:03,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:16:03,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:16:04,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:16:04,016 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-26 14:16:04,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:04,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:04,017 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-26 14:16:04,018 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-26 14:16:04,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-26 14:16:04,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:16:04,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:16:04,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:16:04,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:16:04,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:16:04,026 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:16:04,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:16:04,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:16:04,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-07-26 14:16:04,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:04,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:04,043 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-26 14:16:04,044 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-26 14:16:04,045 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-26 14:16:04,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:16:04,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:16:04,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:16:04,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:16:04,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:16:04,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:16:04,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:16:04,098 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-26 14:16:04,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:04,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:04,099 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-26 14:16:04,100 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-26 14:16:04,102 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-26 14:16:04,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:16:04,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:16:04,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:16:04,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:16:04,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:16:04,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:16:04,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:16:04,110 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:16:04,111 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-26 14:16:04,111 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-26 14:16:04,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:16:04,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:16:04,112 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-26 14:16:04,113 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-26 14:16:04,114 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:16:04,114 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-26 14:16:04,114 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:16:04,114 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~counter~0) = 1*~counter~0 Supporting invariants [] [2022-07-26 14:16:04,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-07-26 14:16:04,130 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-26 14:16:04,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:16:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:16:04,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:16:04,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:16:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:16:04,188 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-26 14:16:04,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:16:04,188 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-26 14:16:04,188 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:16:04,189 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 114 transitions. cyclomatic complexity: 79 Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-26 14:16:04,219 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 114 transitions. cyclomatic complexity: 79. Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 60 states and 124 transitions. Complement of second has 5 states. [2022-07-26 14:16:04,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:16:04,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-26 14:16:04,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-07-26 14:16:04,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 11 letters. Loop has 1 letters. [2022-07-26 14:16:04,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:16:04,221 INFO L680 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-26 14:16:04,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:16:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:16:04,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:16:04,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:16:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:16:04,266 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-26 14:16:04,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:16:04,266 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-26 14:16:04,267 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:16:04,267 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 114 transitions. cyclomatic complexity: 79 Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-26 14:16:04,282 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 114 transitions. cyclomatic complexity: 79. Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 60 states and 124 transitions. Complement of second has 5 states. [2022-07-26 14:16:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:16:04,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-26 14:16:04,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-07-26 14:16:04,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 11 letters. Loop has 1 letters. [2022-07-26 14:16:04,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:16:04,285 INFO L680 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-26 14:16:04,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:16:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:16:04,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:16:04,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:16:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:16:04,324 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-26 14:16:04,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:16:04,325 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-26 14:16:04,325 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:16:04,325 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 114 transitions. cyclomatic complexity: 79 Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-26 14:16:04,346 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 114 transitions. cyclomatic complexity: 79. Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 84 states and 172 transitions. Complement of second has 4 states. [2022-07-26 14:16:04,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:16:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-26 14:16:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-07-26 14:16:04,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 11 letters. Loop has 1 letters. [2022-07-26 14:16:04,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:16:04,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 12 letters. Loop has 1 letters. [2022-07-26 14:16:04,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:16:04,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-26 14:16:04,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:16:04,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 172 transitions. [2022-07-26 14:16:04,348 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 14:16:04,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 0 states and 0 transitions. [2022-07-26 14:16:04,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-26 14:16:04,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-26 14:16:04,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-26 14:16:04,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:16:04,349 INFO L220 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:16:04,349 INFO L242 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:16:04,349 INFO L426 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:16:04,349 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-26 14:16:04,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-26 14:16:04,349 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 14:16:04,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-26 14:16:04,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 02:16:04 BoogieIcfgContainer [2022-07-26 14:16:04,353 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 14:16:04,354 INFO L158 Benchmark]: Toolchain (without parser) took 6107.23ms. Allocated memory was 202.4MB in the beginning and 264.2MB in the end (delta: 61.9MB). Free memory was 151.5MB in the beginning and 200.7MB in the end (delta: -49.2MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. [2022-07-26 14:16:04,354 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 202.4MB. Free memory is still 167.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 14:16:04,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.43ms. Allocated memory is still 202.4MB. Free memory was 151.4MB in the beginning and 177.6MB in the end (delta: -26.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-07-26 14:16:04,354 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.44ms. Allocated memory is still 202.4MB. Free memory was 177.6MB in the beginning and 175.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 14:16:04,354 INFO L158 Benchmark]: Boogie Preprocessor took 14.92ms. Allocated memory is still 202.4MB. Free memory was 175.8MB in the beginning and 174.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-26 14:16:04,355 INFO L158 Benchmark]: RCFGBuilder took 268.40ms. Allocated memory is still 202.4MB. Free memory was 174.7MB in the beginning and 161.9MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-07-26 14:16:04,355 INFO L158 Benchmark]: BuchiAutomizer took 5598.80ms. Allocated memory was 202.4MB in the beginning and 264.2MB in the end (delta: 61.9MB). Free memory was 161.6MB in the beginning and 200.7MB in the end (delta: -39.0MB). Peak memory consumption was 24.4MB. Max. memory is 8.0GB. [2022-07-26 14:16:04,356 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.12ms. Allocated memory is still 202.4MB. Free memory is still 167.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.43ms. Allocated memory is still 202.4MB. Free memory was 151.4MB in the beginning and 177.6MB in the end (delta: -26.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.44ms. Allocated memory is still 202.4MB. Free memory was 177.6MB in the beginning and 175.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.92ms. Allocated memory is still 202.4MB. Free memory was 175.8MB in the beginning and 174.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 268.40ms. Allocated memory is still 202.4MB. Free memory was 174.7MB in the beginning and 161.9MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 5598.80ms. Allocated memory was 202.4MB in the beginning and 264.2MB in the end (delta: 61.9MB). Free memory was 161.6MB in the beginning and 200.7MB in the end (delta: -39.0MB). Peak memory consumption was 24.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function counter and consists of 3 locations. One deterministic module has affine ranking function counter and consists of 3 locations. One nondeterministic module has affine ranking function counter and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.4s and 5 iterations. TraceHistogramMax:3. Analysis of lassos took 3.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 34 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 106 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 162 IncrementalHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 18 mSDtfsCounter, 162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax215 hnf100 lsp22 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 39ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 1.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 75 PlacesBefore, 20 PlacesAfterwards, 73 TransitionsBefore, 15 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 5 FixpointIterations, 37 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 66 TotalNumberOfCompositions, 493 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 481, positive: 478, positive conditional: 0, positive unconditional: 478, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 276, positive: 273, positive conditional: 0, positive unconditional: 273, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 481, positive: 205, positive conditional: 0, positive unconditional: 205, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 276, unknown conditional: 0, unknown unconditional: 276] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 19, Positive conditional cache size: 0, Positive unconditional cache size: 19, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2022-07-26 14:16:04,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-26 14:16:04,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...