/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-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:47:56,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:47:56,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:47:56,928 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:47:56,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:47:56,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:47:56,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:47:56,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:47:56,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:47:56,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:47:56,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:47:56,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:47:56,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:47:56,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:47:56,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:47:56,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:47:56,971 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:47:56,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:47:56,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:47:56,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:47:56,991 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:47:56,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:47:56,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:47:56,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:47:56,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:47:56,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:47:56,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:47:57,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:47:57,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:47:57,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:47:57,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:47:57,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:47:57,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:47:57,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:47:57,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:47:57,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:47:57,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:47:57,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:47:57,008 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:47:57,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:47:57,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:47:57,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:47:57,014 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-22 12:47:57,068 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:47:57,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:47:57,069 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:47:57,069 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:47:57,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:47:57,071 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:47:57,071 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:47:57,071 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:47:57,071 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:47:57,072 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:47:57,072 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:47:57,072 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:47:57,072 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:47:57,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:47:57,073 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:47:57,073 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:47:57,073 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:47:57,073 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:47:57,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:47:57,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:47:57,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:47:57,074 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:47:57,074 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:47:57,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:47:57,075 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:47:57,075 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:47:57,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:47:57,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:47:57,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:47:57,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:47:57,076 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:47:57,077 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:47:57,078 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:47:57,078 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-07-22 12:47:57,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:47:57,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:47:57,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:47:57,530 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:47:57,534 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:47:57,536 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c [2022-07-22 12:47:57,628 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acf47a478/beee9ee0bbc345f6811b59014ee4bd16/FLAGcc6e41118 [2022-07-22 12:47:58,321 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:47:58,322 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c [2022-07-22 12:47:58,333 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acf47a478/beee9ee0bbc345f6811b59014ee4bd16/FLAGcc6e41118 [2022-07-22 12:47:58,653 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acf47a478/beee9ee0bbc345f6811b59014ee4bd16 [2022-07-22 12:47:58,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:47:58,662 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:47:58,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:47:58,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:47:58,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:47:58,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:47:58" (1/1) ... [2022-07-22 12:47:58,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@814fd93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:58, skipping insertion in model container [2022-07-22 12:47:58,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:47:58" (1/1) ... [2022-07-22 12:47:58,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:47:58,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:47:58,904 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-alt.wvr.c[2087,2100] [2022-07-22 12:47:58,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:47:58,916 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:47:58,941 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-alt.wvr.c[2087,2100] [2022-07-22 12:47:58,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:47:58,961 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:47:58,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:58 WrapperNode [2022-07-22 12:47:58,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:47:58,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:47:58,963 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:47:58,964 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:47:58,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:58" (1/1) ... [2022-07-22 12:47:58,983 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:58" (1/1) ... [2022-07-22 12:47:59,009 INFO L137 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 74 [2022-07-22 12:47:59,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:47:59,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:47:59,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:47:59,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:47:59,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:58" (1/1) ... [2022-07-22 12:47:59,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:58" (1/1) ... [2022-07-22 12:47:59,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:58" (1/1) ... [2022-07-22 12:47:59,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:58" (1/1) ... [2022-07-22 12:47:59,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:58" (1/1) ... [2022-07-22 12:47:59,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:58" (1/1) ... [2022-07-22 12:47:59,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:58" (1/1) ... [2022-07-22 12:47:59,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:47:59,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:47:59,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:47:59,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:47:59,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:58" (1/1) ... [2022-07-22 12:47:59,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:59,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:59,082 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:47:59,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 12:47:59,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:47:59,160 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:47:59,160 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:47:59,161 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:47:59,161 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:47:59,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:47:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:47:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:47:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:47:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:47:59,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:47:59,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:47:59,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:47:59,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:47:59,166 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 12:47:59,283 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:47:59,286 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:47:59,510 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:47:59,585 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:47:59,586 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 12:47:59,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:47:59 BoogieIcfgContainer [2022-07-22 12:47:59,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:47:59,591 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:47:59,591 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:47:59,597 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:47:59,598 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:47:59,598 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:47:58" (1/3) ... [2022-07-22 12:47:59,600 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fda83d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:47:59, skipping insertion in model container [2022-07-22 12:47:59,600 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:47:59,600 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:58" (2/3) ... [2022-07-22 12:47:59,601 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fda83d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:47:59, skipping insertion in model container [2022-07-22 12:47:59,601 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:47:59,601 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:47:59" (3/3) ... [2022-07-22 12:47:59,603 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-figure1-alt.wvr.c [2022-07-22 12:47:59,700 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:47:59,758 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 88 transitions, 192 flow [2022-07-22 12:47:59,841 INFO L129 PetriNetUnfolder]: 6/84 cut-off events. [2022-07-22 12:47:59,842 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:47:59,849 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 84 events. 6/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2022-07-22 12:47:59,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 88 transitions, 192 flow [2022-07-22 12:47:59,865 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 84 transitions, 180 flow [2022-07-22 12:47:59,870 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:47:59,885 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 84 transitions, 180 flow [2022-07-22 12:47:59,893 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 84 transitions, 180 flow [2022-07-22 12:47:59,894 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 84 transitions, 180 flow [2022-07-22 12:47:59,945 INFO L129 PetriNetUnfolder]: 6/84 cut-off events. [2022-07-22 12:47:59,945 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:47:59,946 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 84 events. 6/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2022-07-22 12:47:59,949 INFO L116 LiptonReduction]: Number of co-enabled transitions 500 [2022-07-22 12:48:02,889 INFO L131 LiptonReduction]: Checked pairs total: 527 [2022-07-22 12:48:02,890 INFO L133 LiptonReduction]: Total number of compositions: 82 [2022-07-22 12:48:02,927 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:48:02,927 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:48:02,928 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:48:02,928 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:48:02,929 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:48:02,929 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:48:02,929 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:48:02,930 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:48:02,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:48:03,003 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:48:03,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:03,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:03,011 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:48:03,012 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:48:03,012 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:48:03,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 33 states, but on-demand construction may add more states [2022-07-22 12:48:03,025 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:48:03,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:03,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:03,026 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:48:03,026 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:48:03,036 INFO L748 eck$LassoCheckResult]: Stem: 90#[ULTIMATE.startENTRY]don't care [330] ULTIMATE.startENTRY-->L70-3: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| 0)) (= |v_#NULL.base_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= 2 (select |v_#length_66| 1)) (= |v_#length_65| (store (store |v_#length_66| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4)) (< 0 |v_#StackHeapBarrier_22|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_104|) (= (select |v_#valid_105| 1) 1) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre7#1_35|))) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_main_#t~pre7#1_35| |v_#pthreadsForks_40|) (= 25 (select |v_#length_66| 2)) (= (ite (and (<= 0 v_~N1~0_49) (<= 0 v_~N2~0_45)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_41| 0) (= (select |v_#valid_105| 0) 0) (= (select |v_#valid_105| 2) 1) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_10| 0) (= (select |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= v_~counter~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_44|, #length=|v_#length_66|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, #NULL.offset=|v_#NULL.offset_10|, ~N2~0=v_~N2~0_45, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_24|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_49|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_26|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_35|, #length=|v_#length_65|, ~counter~0=v_~counter~0_80, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_17|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_40|, ~N1~0=v_~N1~0_49, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_22|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ~N2~0, ~N1~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem12#1, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, #valid, #memory_int, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 93#[L70-3]don't care [249] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, 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|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, 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] 95#[thread1ENTRY, L70-4]don't care [224] 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] 97#[L41-4, L70-4]don't care [2022-07-22 12:48:03,036 INFO L750 eck$LassoCheckResult]: Loop: 97#[L41-4, L70-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 97#[L41-4, L70-4]don't care [2022-07-22 12:48:03,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:03,043 INFO L85 PathProgramCache]: Analyzing trace with hash 354864, now seen corresponding path program 1 times [2022-07-22 12:48:03,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:03,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513310080] [2022-07-22 12:48:03,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:03,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:03,206 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:03,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:03,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:03,267 INFO L85 PathProgramCache]: Analyzing trace with hash 338, now seen corresponding path program 1 times [2022-07-22 12:48:03,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:03,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307241377] [2022-07-22 12:48:03,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:03,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:03,275 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:03,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:03,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:03,288 INFO L85 PathProgramCache]: Analyzing trace with hash 11001091, now seen corresponding path program 1 times [2022-07-22 12:48:03,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:03,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501456005] [2022-07-22 12:48:03,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:03,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:03,316 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:03,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:03,405 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:03,405 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:03,406 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:03,406 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:03,406 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:48:03,406 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:03,406 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:03,406 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:03,407 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration1_Loop [2022-07-22 12:48:03,407 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:03,407 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:03,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:03,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:03,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:03,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:03,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:03,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:03,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:03,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:03,519 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:03,520 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:48:03,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:03,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:03,525 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:03,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 12:48:03,539 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:03,539 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:03,565 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:03,565 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-22 12:48:03,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 12:48:03,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:03,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:03,620 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:03,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 12:48:03,639 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:03,639 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:03,694 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-22 12:48:03,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:03,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:03,696 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:03,702 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:48:03,702 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:03,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 12:48:03,941 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:48:03,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:03,945 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:03,945 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:03,945 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:03,945 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:03,946 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:48:03,946 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:03,946 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:03,946 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:03,946 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration1_Loop [2022-07-22 12:48:03,947 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:03,947 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:03,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:03,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:03,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:03,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:03,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:03,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:03,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:03,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:04,037 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:04,042 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:48:04,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:04,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:04,046 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:04,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:04,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:04,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:04,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:04,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:04,070 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:04,070 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:04,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 12:48:04,082 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:04,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:04,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:04,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:04,127 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:04,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:04,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:04,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:04,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:04,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:04,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:04,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:04,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:04,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 12:48:04,157 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:48:04,164 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:48:04,165 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:48:04,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:04,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:04,169 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:04,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 12:48:04,173 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:48:04,173 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:48:04,173 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:48:04,174 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~i~0, ~N1~0) = -1*thread1Thread1of1ForFork1_~i~0 + 1*~N1~0 Supporting invariants [] [2022-07-22 12:48:04,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:04,216 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:48:04,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:04,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:04,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:04,314 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:48:04,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:04,352 INFO L142 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-22 12:48:04,354 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-22 12:48:04,425 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 63 states and 161 transitions. Complement of second has 3 states. [2022-07-22 12:48:04,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:04,434 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-22 12:48:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 10 transitions. [2022-07-22 12:48:04,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 3 letters. Loop has 1 letters. [2022-07-22 12:48:04,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:04,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 4 letters. Loop has 1 letters. [2022-07-22 12:48:04,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:04,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 3 letters. Loop has 2 letters. [2022-07-22 12:48:04,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:04,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 161 transitions. [2022-07-22 12:48:04,445 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2022-07-22 12:48:04,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 52 states and 135 transitions. [2022-07-22 12:48:04,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-22 12:48:04,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-07-22 12:48:04,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 135 transitions. [2022-07-22 12:48:04,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:48:04,457 INFO L220 hiAutomatonCegarLoop]: Abstraction has 52 states and 135 transitions. [2022-07-22 12:48:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 135 transitions. [2022-07-22 12:48:04,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2022-07-22 12:48:04,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.6) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 104 transitions. [2022-07-22 12:48:04,496 INFO L242 hiAutomatonCegarLoop]: Abstraction has 40 states and 104 transitions. [2022-07-22 12:48:04,497 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 104 transitions. [2022-07-22 12:48:04,497 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:48:04,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 104 transitions. [2022-07-22 12:48:04,499 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2022-07-22 12:48:04,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:04,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:04,500 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:48:04,500 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:48:04,501 INFO L748 eck$LassoCheckResult]: Stem: 316#[ULTIMATE.startENTRY]don't care [330] ULTIMATE.startENTRY-->L70-3: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| 0)) (= |v_#NULL.base_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= 2 (select |v_#length_66| 1)) (= |v_#length_65| (store (store |v_#length_66| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4)) (< 0 |v_#StackHeapBarrier_22|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_104|) (= (select |v_#valid_105| 1) 1) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre7#1_35|))) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_main_#t~pre7#1_35| |v_#pthreadsForks_40|) (= 25 (select |v_#length_66| 2)) (= (ite (and (<= 0 v_~N1~0_49) (<= 0 v_~N2~0_45)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_41| 0) (= (select |v_#valid_105| 0) 0) (= (select |v_#valid_105| 2) 1) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_10| 0) (= (select |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= v_~counter~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_44|, #length=|v_#length_66|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, #NULL.offset=|v_#NULL.offset_10|, ~N2~0=v_~N2~0_45, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_24|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_49|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_26|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_35|, #length=|v_#length_65|, ~counter~0=v_~counter~0_80, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_17|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_40|, ~N1~0=v_~N1~0_49, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_22|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ~N2~0, ~N1~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem12#1, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, #valid, #memory_int, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 318#[L70-3]don't care [249] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, 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|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, 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] 314#[thread1ENTRY, L70-4]don't care [224] 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] 280#[L41-4, L70-4]don't care [305] L70-4-->L71-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre9#1_17| |v_#pthreadsForks_20|) (= (select |v_#valid_60| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre9#1_17|)))) InVars {#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_22|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{#pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_11|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_21|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet8#1, #memory_int, ULTIMATE.start_main_#t~pre7#1] 282#[L71-3, L41-4]don't care [2022-07-22 12:48:04,501 INFO L750 eck$LassoCheckResult]: Loop: 282#[L71-3, L41-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 282#[L71-3, L41-4]don't care [2022-07-22 12:48:04,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:04,502 INFO L85 PathProgramCache]: Analyzing trace with hash 11001089, now seen corresponding path program 1 times [2022-07-22 12:48:04,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:04,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824481301] [2022-07-22 12:48:04,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:04,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:04,529 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:04,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:04,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:04,584 INFO L85 PathProgramCache]: Analyzing trace with hash 338, now seen corresponding path program 2 times [2022-07-22 12:48:04,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:04,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447245013] [2022-07-22 12:48:04,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:04,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:04,595 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:04,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:04,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:04,609 INFO L85 PathProgramCache]: Analyzing trace with hash 341034066, now seen corresponding path program 1 times [2022-07-22 12:48:04,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:04,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127400471] [2022-07-22 12:48:04,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:04,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:04,641 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:04,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:04,681 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:04,682 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:04,682 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:04,682 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:04,682 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:48:04,682 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:04,682 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:04,683 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:04,683 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration2_Loop [2022-07-22 12:48:04,683 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:04,683 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:04,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:04,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:04,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:04,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:04,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:04,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:04,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:04,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:04,757 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:04,757 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:48:04,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:04,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:04,759 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:04,771 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:04,771 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:04,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 12:48:04,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:04,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:04,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:04,832 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:04,837 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:48:04,837 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:04,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 12:48:04,865 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:04,865 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-22 12:48:04,905 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-22 12:48:04,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:04,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:04,907 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:04,911 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:04,912 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:04,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 12:48:04,933 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:04,933 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_3=1} Honda state: {v_rep#funAddr~thread2.offset_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:04,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:04,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:04,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:04,974 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:04,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 12:48:04,978 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:04,978 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:05,000 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:05,000 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_3=-1} Honda state: {v_rep#funAddr~thread1.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:05,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:05,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:05,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:05,030 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:05,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 12:48:05,032 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:05,035 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:05,056 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:05,056 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_3=-1} Honda state: {v_rep#funAddr~thread2.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:05,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-22 12:48:05,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:05,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:05,085 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:05,088 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:05,089 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:05,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 12:48:05,099 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:05,099 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-22 12:48:05,124 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-22 12:48:05,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:05,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:05,128 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:05,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 12:48:05,130 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:05,130 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:05,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:05,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:05,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:05,167 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:05,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 12:48:05,172 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:48:05,173 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:05,337 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:48:05,340 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-22 12:48:05,341 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:05,341 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:05,341 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:05,341 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:05,341 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:48:05,342 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:05,342 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:05,342 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:05,342 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration2_Loop [2022-07-22 12:48:05,342 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:05,342 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:05,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:05,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:05,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:05,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:05,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:05,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:05,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:05,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:05,450 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:05,450 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:48:05,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:05,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:05,456 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:05,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:05,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:05,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:05,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:05,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:05,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:05,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:05,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:05,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 12:48:05,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:05,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:05,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:05,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:05,536 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:05,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:05,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:05,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:05,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:05,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:05,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:05,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:05,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 12:48:05,574 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:05,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:05,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:05,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:05,618 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:05,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:05,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:05,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:05,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:05,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:05,639 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:05,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:05,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 12:48:05,652 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:05,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:05,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:05,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:05,698 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:05,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:05,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:05,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:05,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:05,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:05,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:05,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:05,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 12:48:05,738 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:05,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:05,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:05,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:05,780 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:05,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:05,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 12:48:05,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:05,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:05,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:05,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:05,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:05,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:05,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:05,812 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:05,851 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-22 12:48:05,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:05,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:05,853 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:05,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 12:48:05,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:05,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:05,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:05,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:05,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:05,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:05,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:05,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:05,868 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:48:05,871 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:48:05,872 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:48:05,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:05,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:05,874 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:05,878 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:48:05,878 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:48:05,878 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:48:05,879 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~i~0, ~N1~0) = -1*thread1Thread1of1ForFork1_~i~0 + 1*~N1~0 Supporting invariants [] [2022-07-22 12:48:05,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 12:48:05,903 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-22 12:48:05,904 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:48:05,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:05,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:05,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:05,951 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:48:05,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:05,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:05,952 INFO L142 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-22 12:48:05,952 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 104 transitions. cyclomatic complexity: 84 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:05,977 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 104 transitions. cyclomatic complexity: 84. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 45 states and 115 transitions. Complement of second has 3 states. [2022-07-22 12:48:05,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:05,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:05,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 7 transitions. [2022-07-22 12:48:05,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 4 letters. Loop has 1 letters. [2022-07-22 12:48:05,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:05,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:48:05,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:05,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-22 12:48:05,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:05,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 115 transitions. [2022-07-22 12:48:05,983 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2022-07-22 12:48:05,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 115 transitions. [2022-07-22 12:48:05,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-22 12:48:05,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2022-07-22 12:48:05,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 115 transitions. [2022-07-22 12:48:05,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:48:05,987 INFO L220 hiAutomatonCegarLoop]: Abstraction has 45 states and 115 transitions. [2022-07-22 12:48:05,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 115 transitions. [2022-07-22 12:48:05,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2022-07-22 12:48:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.58974358974359) internal successors, (101), 38 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:05,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 101 transitions. [2022-07-22 12:48:05,993 INFO L242 hiAutomatonCegarLoop]: Abstraction has 39 states and 101 transitions. [2022-07-22 12:48:05,993 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 101 transitions. [2022-07-22 12:48:05,993 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:48:05,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 101 transitions. [2022-07-22 12:48:05,995 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2022-07-22 12:48:05,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:05,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:05,995 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:48:05,996 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:48:05,996 INFO L748 eck$LassoCheckResult]: Stem: 472#[ULTIMATE.startENTRY]don't care [330] ULTIMATE.startENTRY-->L70-3: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| 0)) (= |v_#NULL.base_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= 2 (select |v_#length_66| 1)) (= |v_#length_65| (store (store |v_#length_66| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4)) (< 0 |v_#StackHeapBarrier_22|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_104|) (= (select |v_#valid_105| 1) 1) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre7#1_35|))) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_main_#t~pre7#1_35| |v_#pthreadsForks_40|) (= 25 (select |v_#length_66| 2)) (= (ite (and (<= 0 v_~N1~0_49) (<= 0 v_~N2~0_45)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_41| 0) (= (select |v_#valid_105| 0) 0) (= (select |v_#valid_105| 2) 1) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_10| 0) (= (select |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= v_~counter~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_44|, #length=|v_#length_66|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, #NULL.offset=|v_#NULL.offset_10|, ~N2~0=v_~N2~0_45, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_24|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_49|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_26|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_35|, #length=|v_#length_65|, ~counter~0=v_~counter~0_80, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_17|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_40|, ~N1~0=v_~N1~0_49, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_22|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ~N2~0, ~N1~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem12#1, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, #valid, #memory_int, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 474#[L70-3]don't care [249] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, 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|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, 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] 470#[thread1ENTRY, L70-4]don't care [224] 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] 436#[L41-4, L70-4]don't care [305] L70-4-->L71-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre9#1_17| |v_#pthreadsForks_20|) (= (select |v_#valid_60| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre9#1_17|)))) InVars {#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_22|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{#pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_11|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_21|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet8#1, #memory_int, ULTIMATE.start_main_#t~pre7#1] 438#[L71-3, L41-4]don't care [246] L71-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#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|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, 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, 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] 444#[thread2ENTRY, L41-4, L71-4]don't care [2022-07-22 12:48:05,997 INFO L750 eck$LassoCheckResult]: Loop: 444#[thread2ENTRY, L41-4, L71-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 444#[thread2ENTRY, L41-4, L71-4]don't care [2022-07-22 12:48:05,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:05,998 INFO L85 PathProgramCache]: Analyzing trace with hash 341034005, now seen corresponding path program 1 times [2022-07-22 12:48:05,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:05,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009948631] [2022-07-22 12:48:05,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:05,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:06,015 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:06,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:06,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:06,037 INFO L85 PathProgramCache]: Analyzing trace with hash 338, now seen corresponding path program 3 times [2022-07-22 12:48:06,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:06,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013956978] [2022-07-22 12:48:06,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:06,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:06,042 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:06,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:06,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:06,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1982119870, now seen corresponding path program 1 times [2022-07-22 12:48:06,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:06,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793453302] [2022-07-22 12:48:06,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:06,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:06,063 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:06,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:06,097 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:06,097 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:06,097 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:06,098 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:06,098 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:48:06,098 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:06,098 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:06,098 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:06,098 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration3_Loop [2022-07-22 12:48:06,098 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:06,098 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:06,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:06,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:06,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:06,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:06,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:06,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:06,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:06,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:06,165 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:06,165 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:48:06,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:06,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:06,167 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:06,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 12:48:06,171 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:06,173 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:06,190 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:06,190 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-22 12:48:06,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:06,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:06,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:06,236 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:06,248 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:06,248 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:06,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 12:48:06,268 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:06,268 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-22 12:48:06,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:06,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:06,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:06,314 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:06,318 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:06,318 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:06,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 12:48:06,381 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:06,382 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_5=1} Honda state: {v_rep#funAddr~thread2.offset_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:06,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:06,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:06,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:06,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:06,459 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:06,471 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-22 12:48:06,472 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:06,472 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:06,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 12:48:06,491 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:06,491 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-22 12:48:06,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:06,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:06,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:06,530 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:06,532 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:06,532 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:06,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 12:48:06,551 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:06,551 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_5=-1} Honda state: {v_rep#funAddr~thread2.base_5=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:06,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:06,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:06,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:06,594 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:06,596 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:06,596 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:06,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 12:48:06,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:06,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:06,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:06,659 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:06,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:48:06,662 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:06,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 12:48:06,854 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:48:06,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-22 12:48:06,858 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:06,859 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:06,859 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:06,859 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:06,859 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:48:06,859 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:06,859 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:06,859 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:06,860 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration3_Loop [2022-07-22 12:48:06,860 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:06,860 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:06,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:06,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:06,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:06,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:06,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:06,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:06,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:06,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:06,937 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:06,938 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:48:06,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:06,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:06,939 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:06,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:06,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:06,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:06,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:06,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:06,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-22 12:48:06,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:06,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:06,984 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:07,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:07,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:07,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:07,022 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:07,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:07,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-22 12:48:07,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:07,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:07,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:07,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:07,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:07,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:07,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:07,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:07,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:07,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:07,081 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:07,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-22 12:48:07,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:07,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:07,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:07,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:07,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:07,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:07,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:07,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:07,094 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:07,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-22 12:48:07,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:07,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:07,117 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:07,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:07,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-22 12:48:07,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:07,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:07,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:07,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:07,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:07,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:07,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:07,128 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:07,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:07,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:07,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:07,154 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:07,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-22 12:48:07,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:07,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:07,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:07,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:07,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:07,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:07,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:07,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:07,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-22 12:48:07,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:07,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:07,203 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:07,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-22 12:48:07,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:07,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:07,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:07,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:07,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:07,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:07,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:07,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:07,239 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:48:07,245 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:48:07,245 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:48:07,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:07,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:07,247 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:07,256 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:48:07,256 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:48:07,256 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:48:07,256 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~i~0, ~N1~0) = -1*thread1Thread1of1ForFork1_~i~0 + 1*~N1~0 Supporting invariants [] [2022-07-22 12:48:07,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-22 12:48:07,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:07,295 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:48:07,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:07,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:07,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:07,338 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:48:07,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:07,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:07,339 INFO L142 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-22 12:48:07,339 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 101 transitions. cyclomatic complexity: 81 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-22 12:48:07,363 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 101 transitions. cyclomatic complexity: 81. 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 47 states and 125 transitions. Complement of second has 3 states. [2022-07-22 12:48:07,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:07,364 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-22 12:48:07,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2022-07-22 12:48:07,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:48:07,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:07,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:48:07,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:07,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 12:48:07,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:07,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 125 transitions. [2022-07-22 12:48:07,368 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2022-07-22 12:48:07,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 125 transitions. [2022-07-22 12:48:07,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2022-07-22 12:48:07,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-07-22 12:48:07,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 125 transitions. [2022-07-22 12:48:07,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:48:07,370 INFO L220 hiAutomatonCegarLoop]: Abstraction has 47 states and 125 transitions. [2022-07-22 12:48:07,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 125 transitions. [2022-07-22 12:48:07,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2022-07-22 12:48:07,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.5526315789473686) internal successors, (97), 37 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 97 transitions. [2022-07-22 12:48:07,376 INFO L242 hiAutomatonCegarLoop]: Abstraction has 38 states and 97 transitions. [2022-07-22 12:48:07,376 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 97 transitions. [2022-07-22 12:48:07,376 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:48:07,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 97 transitions. [2022-07-22 12:48:07,378 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2022-07-22 12:48:07,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:07,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:07,378 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:48:07,378 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:48:07,379 INFO L748 eck$LassoCheckResult]: Stem: 631#[ULTIMATE.startENTRY]don't care [330] ULTIMATE.startENTRY-->L70-3: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| 0)) (= |v_#NULL.base_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= 2 (select |v_#length_66| 1)) (= |v_#length_65| (store (store |v_#length_66| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4)) (< 0 |v_#StackHeapBarrier_22|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_104|) (= (select |v_#valid_105| 1) 1) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre7#1_35|))) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_main_#t~pre7#1_35| |v_#pthreadsForks_40|) (= 25 (select |v_#length_66| 2)) (= (ite (and (<= 0 v_~N1~0_49) (<= 0 v_~N2~0_45)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_41| 0) (= (select |v_#valid_105| 0) 0) (= (select |v_#valid_105| 2) 1) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_10| 0) (= (select |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= v_~counter~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_44|, #length=|v_#length_66|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, #NULL.offset=|v_#NULL.offset_10|, ~N2~0=v_~N2~0_45, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_24|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_49|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_26|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_35|, #length=|v_#length_65|, ~counter~0=v_~counter~0_80, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_17|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_40|, ~N1~0=v_~N1~0_49, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_22|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ~N2~0, ~N1~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem12#1, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, #valid, #memory_int, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 633#[L70-3]don't care [249] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, 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|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, 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] 629#[thread1ENTRY, L70-4]don't care [305] L70-4-->L71-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre9#1_17| |v_#pthreadsForks_20|) (= (select |v_#valid_60| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre9#1_17|)))) InVars {#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_22|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{#pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_11|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_21|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet8#1, #memory_int, ULTIMATE.start_main_#t~pre7#1] 617#[L71-3, thread1ENTRY]don't care [246] L71-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#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|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, 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, 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] 621#[thread2ENTRY, thread1ENTRY, L71-4]don't care [234] 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] 635#[thread1ENTRY, L51-4, L71-4]don't care [2022-07-22 12:48:07,379 INFO L750 eck$LassoCheckResult]: Loop: 635#[thread1ENTRY, L51-4, L71-4]don't care [313] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_24| 1) |v_thread2Thread1of1ForFork0_~i~1#1_23|) (< |v_thread2Thread1of1ForFork0_~i~1#1_24| v_~N2~0_29) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 v_~counter~0_73) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_73 (+ v_~counter~0_72 1))) InVars {~counter~0=v_~counter~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_24|, ~N2~0=v_~N2~0_29} OutVars{~counter~0=v_~counter~0_72, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N2~0=v_~N2~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_9|} 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] 635#[thread1ENTRY, L51-4, L71-4]don't care [2022-07-22 12:48:07,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:07,380 INFO L85 PathProgramCache]: Analyzing trace with hash 341110005, now seen corresponding path program 1 times [2022-07-22 12:48:07,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:07,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337043576] [2022-07-22 12:48:07,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:07,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:07,398 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:07,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:07,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:07,417 INFO L85 PathProgramCache]: Analyzing trace with hash 344, now seen corresponding path program 1 times [2022-07-22 12:48:07,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:07,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499400559] [2022-07-22 12:48:07,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:07,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:07,422 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:07,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:07,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:07,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1984475876, now seen corresponding path program 1 times [2022-07-22 12:48:07,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:07,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355933300] [2022-07-22 12:48:07,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:07,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:07,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:07,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:48:07,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355933300] [2022-07-22 12:48:07,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355933300] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:48:07,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:48:07,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-22 12:48:07,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298984757] [2022-07-22 12:48:07,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:48:07,541 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:07,542 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:07,542 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:07,542 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:07,542 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:48:07,542 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:07,542 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:07,543 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:07,543 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration4_Loop [2022-07-22 12:48:07,543 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:07,543 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:07,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:07,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:07,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:07,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:07,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:07,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:07,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:07,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:07,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:07,633 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:07,633 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:48:07,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:07,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:07,634 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:07,639 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:07,639 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:07,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-22 12:48:07,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:07,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:07,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:07,693 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:07,698 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:48:07,699 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:07,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-22 12:48:07,737 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:48:07,740 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-22 12:48:07,740 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:07,740 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:07,740 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:07,740 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:07,740 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:48:07,740 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:07,740 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:07,741 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:07,741 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration4_Loop [2022-07-22 12:48:07,741 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:07,741 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:07,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:07,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:07,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:07,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:07,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:07,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:07,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:07,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:07,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:07,849 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:07,849 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:48:07,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:07,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:07,851 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:07,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:07,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:07,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:07,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:07,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:07,874 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:07,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:07,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-22 12:48:07,888 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:07,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:07,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:07,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:07,927 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:07,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-22 12:48:07,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:07,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:07,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:07,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:07,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:07,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:07,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:07,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:07,960 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:48:07,965 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:48:07,965 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:48:07,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:07,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:07,966 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:07,972 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:48:07,972 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:48:07,972 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:48:07,972 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~counter~0) = 1*~counter~0 Supporting invariants [] [2022-07-22 12:48:07,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-22 12:48:08,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:08,010 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:48:08,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:08,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:08,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:08,055 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 12:48:08,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:08,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:08,057 INFO L142 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-22 12:48:08,057 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 97 transitions. cyclomatic complexity: 77 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-22 12:48:08,093 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 97 transitions. cyclomatic complexity: 77. 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 63 states and 162 transitions. Complement of second has 3 states. [2022-07-22 12:48:08,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:08,094 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-22 12:48:08,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:48:08,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:48:08,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:08,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:48:08,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:08,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 12:48:08,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:08,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 162 transitions. [2022-07-22 12:48:08,097 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 10 [2022-07-22 12:48:08,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 60 states and 158 transitions. [2022-07-22 12:48:08,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2022-07-22 12:48:08,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2022-07-22 12:48:08,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 158 transitions. [2022-07-22 12:48:08,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:48:08,100 INFO L220 hiAutomatonCegarLoop]: Abstraction has 60 states and 158 transitions. [2022-07-22 12:48:08,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 158 transitions. [2022-07-22 12:48:08,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2022-07-22 12:48:08,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.6122448979591835) internal successors, (128), 48 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:08,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 128 transitions. [2022-07-22 12:48:08,107 INFO L242 hiAutomatonCegarLoop]: Abstraction has 49 states and 128 transitions. [2022-07-22 12:48:08,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:48:08,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:48:08,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:48:08,111 INFO L87 Difference]: Start difference. First operand 49 states and 128 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-22 12:48:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:48:08,143 INFO L93 Difference]: Finished difference Result 71 states and 168 transitions. [2022-07-22 12:48:08,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 168 transitions. [2022-07-22 12:48:08,145 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2022-07-22 12:48:08,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 59 states and 142 transitions. [2022-07-22 12:48:08,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2022-07-22 12:48:08,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2022-07-22 12:48:08,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 142 transitions. [2022-07-22 12:48:08,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:48:08,148 INFO L220 hiAutomatonCegarLoop]: Abstraction has 59 states and 142 transitions. [2022-07-22 12:48:08,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 142 transitions. [2022-07-22 12:48:08,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-07-22 12:48:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.4464285714285716) internal successors, (137), 55 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:08,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 137 transitions. [2022-07-22 12:48:08,155 INFO L242 hiAutomatonCegarLoop]: Abstraction has 56 states and 137 transitions. [2022-07-22 12:48:08,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:48:08,156 INFO L425 stractBuchiCegarLoop]: Abstraction has 56 states and 137 transitions. [2022-07-22 12:48:08,156 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:48:08,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 137 transitions. [2022-07-22 12:48:08,157 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2022-07-22 12:48:08,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:08,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:08,158 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:48:08,158 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:48:08,159 INFO L748 eck$LassoCheckResult]: Stem: 992#[ULTIMATE.startENTRY]don't care [330] ULTIMATE.startENTRY-->L70-3: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| 0)) (= |v_#NULL.base_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= 2 (select |v_#length_66| 1)) (= |v_#length_65| (store (store |v_#length_66| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4)) (< 0 |v_#StackHeapBarrier_22|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_104|) (= (select |v_#valid_105| 1) 1) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre7#1_35|))) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_main_#t~pre7#1_35| |v_#pthreadsForks_40|) (= 25 (select |v_#length_66| 2)) (= (ite (and (<= 0 v_~N1~0_49) (<= 0 v_~N2~0_45)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_41| 0) (= (select |v_#valid_105| 0) 0) (= (select |v_#valid_105| 2) 1) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_10| 0) (= (select |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= v_~counter~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_44|, #length=|v_#length_66|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, #NULL.offset=|v_#NULL.offset_10|, ~N2~0=v_~N2~0_45, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_24|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_49|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_26|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_35|, #length=|v_#length_65|, ~counter~0=v_~counter~0_80, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_17|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_40|, ~N1~0=v_~N1~0_49, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_22|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ~N2~0, ~N1~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem12#1, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, #valid, #memory_int, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 994#[L70-3]don't care [249] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, 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|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, 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] 990#[thread1ENTRY, L70-4]don't care [224] 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] 938#[L41-4, L70-4]don't care [305] L70-4-->L71-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre9#1_17| |v_#pthreadsForks_20|) (= (select |v_#valid_60| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre9#1_17|)))) InVars {#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_22|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{#pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_11|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_21|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet8#1, #memory_int, ULTIMATE.start_main_#t~pre7#1] 940#[L71-3, L41-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 1004#[L71-3, L41-4]don't care [246] L71-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#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|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, 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, 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] 1008#[thread2ENTRY, L41-4, L71-4]don't care [304] L71-4-->L72-1: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_19|) (select |v_#length_39| |v_ULTIMATE.start_main_~#t1~0#1.base_21|)) (= (select |v_#valid_58| |v_ULTIMATE.start_main_~#t1~0#1.base_21|) 1) (= (select (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t1~0#1.base_21|) |v_ULTIMATE.start_main_~#t1~0#1.offset_19|) |v_ULTIMATE.start_main_#t~mem11#1_14|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_19|)) InVars {#valid=|v_#valid_58|, #memory_int=|v_#memory_int_19|, #length=|v_#length_39|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_19|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_9|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, #valid=|v_#valid_58|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_14|, #memory_int=|v_#memory_int_19|, #length=|v_#length_39|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~mem11#1] 1010#[thread2ENTRY, L41-4, L72-1]don't care [2022-07-22 12:48:08,159 INFO L750 eck$LassoCheckResult]: Loop: 1010#[thread2ENTRY, L41-4, L72-1]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 1010#[thread2ENTRY, L41-4, L72-1]don't care [2022-07-22 12:48:08,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:08,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1316230860, now seen corresponding path program 1 times [2022-07-22 12:48:08,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:08,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926254352] [2022-07-22 12:48:08,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:08,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:08,179 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:08,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:08,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:08,195 INFO L85 PathProgramCache]: Analyzing trace with hash 338, now seen corresponding path program 4 times [2022-07-22 12:48:08,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:08,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937144103] [2022-07-22 12:48:08,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:08,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:08,199 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:08,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:08,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:08,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2146515993, now seen corresponding path program 2 times [2022-07-22 12:48:08,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:08,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412365720] [2022-07-22 12:48:08,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:08,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:08,221 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:08,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:08,254 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:08,254 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:08,254 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:08,254 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:08,254 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:48:08,254 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:08,254 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:08,254 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:08,254 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration5_Loop [2022-07-22 12:48:08,255 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:08,255 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:08,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:08,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:08,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:08,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:08,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:08,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:08,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:08,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:08,321 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:08,321 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:48:08,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:08,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:08,322 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:08,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:08,329 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:08,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-22 12:48:08,347 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:08,347 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_9=0} Honda state: {v_rep#funAddr~thread1.offset_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:08,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:08,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:08,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:08,384 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:08,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-22 12:48:08,385 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:08,385 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:08,393 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:08,393 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-22 12:48:08,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:08,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:08,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:08,417 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:08,424 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:08,425 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:08,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-22 12:48:08,439 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:08,439 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_9=-1} Honda state: {v_rep#funAddr~thread2.base_9=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:08,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:08,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:08,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:08,463 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:08,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-22 12:48:08,464 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:08,464 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:08,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:08,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:08,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:08,497 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:08,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-22 12:48:08,501 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:48:08,501 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:08,522 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:08,523 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-22 12:48:08,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:08,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:08,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:08,551 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:08,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-22 12:48:08,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:08,552 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:08,560 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:08,560 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-22 12:48:08,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-07-22 12:48:08,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:08,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:08,584 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:08,590 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:08,590 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:08,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-22 12:48:08,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-07-22 12:48:08,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:08,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:08,626 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:08,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-22 12:48:08,628 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:48:08,628 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:08,770 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:48:08,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:08,774 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:08,774 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:08,774 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:08,774 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:08,774 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:48:08,774 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:08,774 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:08,774 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:08,774 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration5_Loop [2022-07-22 12:48:08,774 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:08,774 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:08,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:08,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:08,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:08,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:08,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:08,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:08,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:08,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:08,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:08,897 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:08,897 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:48:08,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:08,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:08,898 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:08,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:08,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:08,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:08,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:08,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:08,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:08,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:08,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:08,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-22 12:48:08,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:08,928 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:08,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:08,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:08,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:08,957 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:08,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-22 12:48:08,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:08,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:08,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:08,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:08,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:08,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:08,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:08,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:08,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:08,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-07-22 12:48:08,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:08,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:08,994 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:08,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:09,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:09,005 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:09,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:09,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:09,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:09,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:09,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:09,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-22 12:48:09,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:09,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:09,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:09,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:09,034 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:09,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-22 12:48:09,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:09,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:09,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:09,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:09,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:09,049 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:09,049 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:09,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:09,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:09,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:09,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:09,092 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:09,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-22 12:48:09,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:09,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:09,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:09,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:09,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:09,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:09,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:09,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:09,116 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:48:09,119 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:48:09,120 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:48:09,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:09,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:09,121 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:09,122 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:48:09,122 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:48:09,122 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:48:09,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-22 12:48:09,122 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~i~0, ~N1~0) = -1*thread1Thread1of1ForFork1_~i~0 + 1*~N1~0 Supporting invariants [] [2022-07-22 12:48:09,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-07-22 12:48:09,147 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:48:09,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:09,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:09,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:09,199 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:48:09,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:09,200 INFO L142 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-22 12:48:09,201 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 137 transitions. cyclomatic complexity: 102 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:09,231 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 137 transitions. cyclomatic complexity: 102. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 73 states and 176 transitions. Complement of second has 3 states. [2022-07-22 12:48:09,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:09,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:48:09,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:48:09,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:09,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:48:09,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:09,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:48:09,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:09,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 176 transitions. [2022-07-22 12:48:09,235 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2022-07-22 12:48:09,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 68 states and 167 transitions. [2022-07-22 12:48:09,237 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2022-07-22 12:48:09,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2022-07-22 12:48:09,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 167 transitions. [2022-07-22 12:48:09,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:48:09,239 INFO L220 hiAutomatonCegarLoop]: Abstraction has 68 states and 167 transitions. [2022-07-22 12:48:09,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 167 transitions. [2022-07-22 12:48:09,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2022-07-22 12:48:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.482142857142857) internal successors, (139), 55 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:09,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 139 transitions. [2022-07-22 12:48:09,245 INFO L242 hiAutomatonCegarLoop]: Abstraction has 56 states and 139 transitions. [2022-07-22 12:48:09,245 INFO L425 stractBuchiCegarLoop]: Abstraction has 56 states and 139 transitions. [2022-07-22 12:48:09,245 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:48:09,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 139 transitions. [2022-07-22 12:48:09,246 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2022-07-22 12:48:09,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:09,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:09,247 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:48:09,247 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:48:09,248 INFO L748 eck$LassoCheckResult]: Stem: 1211#[ULTIMATE.startENTRY]don't care [330] ULTIMATE.startENTRY-->L70-3: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| 0)) (= |v_#NULL.base_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= 2 (select |v_#length_66| 1)) (= |v_#length_65| (store (store |v_#length_66| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4)) (< 0 |v_#StackHeapBarrier_22|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_104|) (= (select |v_#valid_105| 1) 1) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre7#1_35|))) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_main_#t~pre7#1_35| |v_#pthreadsForks_40|) (= 25 (select |v_#length_66| 2)) (= (ite (and (<= 0 v_~N1~0_49) (<= 0 v_~N2~0_45)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_41| 0) (= (select |v_#valid_105| 0) 0) (= (select |v_#valid_105| 2) 1) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_10| 0) (= (select |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= v_~counter~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_44|, #length=|v_#length_66|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, #NULL.offset=|v_#NULL.offset_10|, ~N2~0=v_~N2~0_45, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_24|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_49|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_26|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_35|, #length=|v_#length_65|, ~counter~0=v_~counter~0_80, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_17|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_40|, ~N1~0=v_~N1~0_49, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_22|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ~N2~0, ~N1~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem12#1, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, #valid, #memory_int, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1213#[L70-3]don't care [249] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, 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|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, 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] 1209#[thread1ENTRY, L70-4]don't care [224] 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] 1159#[L41-4, L70-4]don't care [305] L70-4-->L71-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre9#1_17| |v_#pthreadsForks_20|) (= (select |v_#valid_60| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre9#1_17|)))) InVars {#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_22|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{#pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_11|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_21|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet8#1, #memory_int, ULTIMATE.start_main_#t~pre7#1] 1161#[L71-3, L41-4]don't care [246] L71-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#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|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, 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, 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] 1175#[thread2ENTRY, L41-4, L71-4]don't care [234] 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] 1181#[L41-4, L51-4, L71-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 1197#[L41-4, L51-4, L71-4]don't care [2022-07-22 12:48:09,248 INFO L750 eck$LassoCheckResult]: Loop: 1197#[L41-4, L51-4, L71-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 1197#[L41-4, L51-4, L71-4]don't care [2022-07-22 12:48:09,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:09,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1316171870, now seen corresponding path program 1 times [2022-07-22 12:48:09,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:09,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188361681] [2022-07-22 12:48:09,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:09,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:09,264 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:09,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:09,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:09,280 INFO L85 PathProgramCache]: Analyzing trace with hash 338, now seen corresponding path program 5 times [2022-07-22 12:48:09,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:09,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902559484] [2022-07-22 12:48:09,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:09,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:09,285 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:09,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:09,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:09,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2146622613, now seen corresponding path program 2 times [2022-07-22 12:48:09,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:09,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885246100] [2022-07-22 12:48:09,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:09,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:09,303 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:09,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:09,333 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:09,333 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:09,334 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:09,334 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:09,334 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:48:09,334 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:09,334 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:09,334 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:09,334 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration6_Loop [2022-07-22 12:48:09,334 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:09,334 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:09,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:09,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:09,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:09,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:09,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:09,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:09,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:09,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:09,392 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:09,393 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:48:09,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:09,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:09,394 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:09,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-22 12:48:09,397 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:09,397 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:09,410 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:09,410 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_11=1} Honda state: {v_rep#funAddr~thread2.offset_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:09,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-07-22 12:48:09,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:09,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:09,434 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:09,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-22 12:48:09,437 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:09,438 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:09,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:09,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:09,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:09,469 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:09,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-22 12:48:09,470 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:48:09,470 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:09,491 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:09,492 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-22 12:48:09,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:09,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:09,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:09,515 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:09,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-22 12:48:09,516 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:09,517 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:09,531 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:09,531 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_11=0} Honda state: {v_rep#funAddr~thread1.offset_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:09,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:09,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:09,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:09,557 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:09,561 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:09,561 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:09,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-22 12:48:09,571 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:09,571 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-22 12:48:09,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:09,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:09,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:09,594 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:09,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-22 12:48:09,596 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:09,596 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:09,608 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:09,609 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_11=-1} Honda state: {v_rep#funAddr~thread2.base_11=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:09,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:09,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:09,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:09,632 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:09,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-07-22 12:48:09,635 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:09,635 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:09,647 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:09,647 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-22 12:48:09,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-07-22 12:48:09,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:09,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:09,670 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:09,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-07-22 12:48:09,672 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:09,672 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:09,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-07-22 12:48:09,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:09,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:09,704 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:09,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-07-22 12:48:09,705 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:48:09,705 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:09,851 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:48:09,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:09,853 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:09,854 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:09,854 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:09,854 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:09,854 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:48:09,854 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:09,854 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:09,854 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:09,854 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration6_Loop [2022-07-22 12:48:09,854 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:09,854 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:09,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:09,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:09,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:09,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:09,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:09,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:09,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:09,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:09,936 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:09,937 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:48:09,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:09,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:09,938 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:09,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-07-22 12:48:09,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:09,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:09,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:09,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:09,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:09,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:09,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:09,958 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:09,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:09,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:09,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:09,981 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:09,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-07-22 12:48:09,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:09,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:09,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:09,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:09,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:09,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:09,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:09,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:10,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-07-22 12:48:10,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:10,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:10,019 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:10,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-07-22 12:48:10,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:10,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:10,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:10,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:10,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:10,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:10,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:10,058 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:10,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:10,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:10,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:10,094 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:10,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:10,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-07-22 12:48:10,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:10,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:10,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:10,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:10,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:10,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:10,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:10,106 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:10,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-07-22 12:48:10,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:10,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:10,130 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:10,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-07-22 12:48:10,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:10,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:10,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:10,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:10,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:10,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:10,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:10,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:10,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:10,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:10,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:10,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:10,168 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:10,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-07-22 12:48:10,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:10,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:10,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:10,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:10,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:10,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:10,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:10,190 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:10,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-07-22 12:48:10,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:10,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:10,222 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:10,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-07-22 12:48:10,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:10,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:10,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:10,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:10,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:10,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:10,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:10,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:10,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:10,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-07-22 12:48:10,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:10,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:10,254 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:10,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-07-22 12:48:10,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:10,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:10,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:10,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:10,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:10,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:10,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:10,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:10,265 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:48:10,267 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:48:10,267 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:48:10,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:10,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:10,268 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:10,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-07-22 12:48:10,269 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:48:10,269 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:48:10,269 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:48:10,270 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N1~0, thread1Thread1of1ForFork1_~i~0) = 1*~N1~0 - 1*thread1Thread1of1ForFork1_~i~0 Supporting invariants [] [2022-07-22 12:48:10,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:10,293 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:48:10,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:10,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:10,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:10,353 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:48:10,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:10,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:10,355 INFO L142 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-22 12:48:10,355 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 139 transitions. cyclomatic complexity: 103 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:10,402 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 139 transitions. cyclomatic complexity: 103. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 196 transitions. Complement of second has 3 states. [2022-07-22 12:48:10,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:10,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 10 transitions. [2022-07-22 12:48:10,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:48:10,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:10,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:48:10,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:10,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:48:10,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:10,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 196 transitions. [2022-07-22 12:48:10,414 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2022-07-22 12:48:10,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 71 states and 185 transitions. [2022-07-22 12:48:10,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2022-07-22 12:48:10,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2022-07-22 12:48:10,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 185 transitions. [2022-07-22 12:48:10,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:48:10,428 INFO L220 hiAutomatonCegarLoop]: Abstraction has 71 states and 185 transitions. [2022-07-22 12:48:10,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 185 transitions. [2022-07-22 12:48:10,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2022-07-22 12:48:10,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.4827586206896552) internal successors, (144), 57 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 144 transitions. [2022-07-22 12:48:10,444 INFO L242 hiAutomatonCegarLoop]: Abstraction has 58 states and 144 transitions. [2022-07-22 12:48:10,445 INFO L425 stractBuchiCegarLoop]: Abstraction has 58 states and 144 transitions. [2022-07-22 12:48:10,445 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 12:48:10,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 144 transitions. [2022-07-22 12:48:10,446 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2022-07-22 12:48:10,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:10,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:10,450 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-22 12:48:10,450 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:48:10,451 INFO L748 eck$LassoCheckResult]: Stem: 1440#[ULTIMATE.startENTRY]don't care [330] ULTIMATE.startENTRY-->L70-3: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| 0)) (= |v_#NULL.base_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= 2 (select |v_#length_66| 1)) (= |v_#length_65| (store (store |v_#length_66| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4)) (< 0 |v_#StackHeapBarrier_22|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_104|) (= (select |v_#valid_105| 1) 1) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre7#1_35|))) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_main_#t~pre7#1_35| |v_#pthreadsForks_40|) (= 25 (select |v_#length_66| 2)) (= (ite (and (<= 0 v_~N1~0_49) (<= 0 v_~N2~0_45)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_41| 0) (= (select |v_#valid_105| 0) 0) (= (select |v_#valid_105| 2) 1) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_10| 0) (= (select |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= v_~counter~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_44|, #length=|v_#length_66|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, #NULL.offset=|v_#NULL.offset_10|, ~N2~0=v_~N2~0_45, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_24|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_49|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_26|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_35|, #length=|v_#length_65|, ~counter~0=v_~counter~0_80, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_17|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_40|, ~N1~0=v_~N1~0_49, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_22|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ~N2~0, ~N1~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem12#1, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, #valid, #memory_int, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1442#[L70-3]don't care [249] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, 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|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, 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] 1438#[thread1ENTRY, L70-4]don't care [224] 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] 1388#[L41-4, L70-4]don't care [305] L70-4-->L71-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre9#1_17| |v_#pthreadsForks_20|) (= (select |v_#valid_60| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre9#1_17|)))) InVars {#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_22|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{#pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_11|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_21|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet8#1, #memory_int, ULTIMATE.start_main_#t~pre7#1] 1390#[L71-3, L41-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 1454#[L71-3, L41-4]don't care [246] L71-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#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|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, 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, 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] 1460#[thread2ENTRY, L41-4, L71-4]don't care [234] 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] 1464#[L41-4, L51-4, L71-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 1472#[L41-4, L51-4, L71-4]don't care [2022-07-22 12:48:10,451 INFO L750 eck$LassoCheckResult]: Loop: 1472#[L41-4, L51-4, L71-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 1472#[L41-4, L51-4, L71-4]don't care [2022-07-22 12:48:10,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:10,451 INFO L85 PathProgramCache]: Analyzing trace with hash -2146518163, now seen corresponding path program 3 times [2022-07-22 12:48:10,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:10,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620513576] [2022-07-22 12:48:10,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:10,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:10,485 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:10,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:10,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:10,527 INFO L85 PathProgramCache]: Analyzing trace with hash 338, now seen corresponding path program 6 times [2022-07-22 12:48:10,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:10,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444568995] [2022-07-22 12:48:10,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:10,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:10,538 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:10,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:10,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:10,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2117553306, now seen corresponding path program 4 times [2022-07-22 12:48:10,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:10,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346246213] [2022-07-22 12:48:10,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:10,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:10,573 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:10,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:10,634 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:10,635 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:10,635 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:10,635 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:10,635 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:48:10,635 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:10,635 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:10,635 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:10,635 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration7_Loop [2022-07-22 12:48:10,636 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:10,636 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:10,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:10,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:10,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:10,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:10,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:10,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:10,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:10,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:10,703 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:10,703 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:48:10,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:10,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:10,705 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:10,707 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:10,707 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:10,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-07-22 12:48:10,726 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:10,726 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-22 12:48:10,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:10,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:10,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:10,763 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:10,768 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:10,768 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:10,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-07-22 12:48:10,783 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:10,783 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_13=1} Honda state: {v_rep#funAddr~thread2.offset_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:10,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2022-07-22 12:48:10,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:10,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:10,806 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:10,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-07-22 12:48:10,808 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:10,808 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:10,816 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:10,817 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-22 12:48:10,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-07-22 12:48:10,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:10,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:10,840 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:10,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-07-22 12:48:10,841 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:10,842 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:10,855 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:10,855 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_13=0} Honda state: {v_rep#funAddr~thread1.offset_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:10,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:10,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:10,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:10,878 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:10,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-07-22 12:48:10,880 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:10,880 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:10,893 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:10,893 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_13=-1} Honda state: {v_rep#funAddr~thread1.base_13=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:10,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:10,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:10,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:10,916 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:10,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-07-22 12:48:10,918 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:10,918 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:10,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:10,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:10,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:10,950 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:10,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-07-22 12:48:10,952 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:48:10,952 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:11,089 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:48:11,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2022-07-22 12:48:11,092 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:11,092 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:11,092 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:11,092 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:11,092 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:48:11,092 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:11,092 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:11,092 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:11,092 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration7_Loop [2022-07-22 12:48:11,092 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:11,092 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:11,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:11,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:11,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:11,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:11,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:11,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:11,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:11,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:11,196 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:11,197 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:48:11,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:11,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:11,198 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:11,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:11,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-07-22 12:48:11,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:11,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:11,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:11,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:11,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:11,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:11,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:11,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:11,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:11,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:11,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:11,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:11,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:11,251 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:11,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-07-22 12:48:11,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:11,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:11,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:11,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:11,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:11,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:11,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:11,284 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:11,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:11,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:11,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:11,318 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:11,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:11,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:11,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:11,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:11,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:11,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:11,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:11,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:11,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-07-22 12:48:11,339 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:11,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2022-07-22 12:48:11,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:11,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:11,365 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:11,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-07-22 12:48:11,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:11,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:11,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:11,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:11,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:11,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:11,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:11,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:11,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:11,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:11,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:11,421 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:11,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:11,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-07-22 12:48:11,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:11,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:11,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:11,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:11,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:11,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:11,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:11,453 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:48:11,455 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:48:11,455 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:48:11,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:11,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:11,456 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:11,458 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:48:11,458 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:48:11,458 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:48:11,458 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N1~0, thread1Thread1of1ForFork1_~i~0) = 1*~N1~0 - 1*thread1Thread1of1ForFork1_~i~0 Supporting invariants [] [2022-07-22 12:48:11,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-07-22 12:48:11,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:11,483 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:48:11,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:11,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:11,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:11,530 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:48:11,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:11,531 INFO L142 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-22 12:48:11,532 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 144 transitions. cyclomatic complexity: 107 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-22 12:48:11,559 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 144 transitions. cyclomatic complexity: 107. 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 71 states and 185 transitions. Complement of second has 3 states. [2022-07-22 12:48:11,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:11,561 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-22 12:48:11,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 9 transitions. [2022-07-22 12:48:11,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:48:11,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:11,561 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:48:11,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:11,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:11,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:11,603 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:48:11,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:11,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:11,605 INFO L142 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-22 12:48:11,605 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 144 transitions. cyclomatic complexity: 107 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-22 12:48:11,635 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 144 transitions. cyclomatic complexity: 107. 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 71 states and 185 transitions. Complement of second has 3 states. [2022-07-22 12:48:11,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:11,636 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-22 12:48:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 9 transitions. [2022-07-22 12:48:11,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:48:11,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:11,637 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:48:11,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:11,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:11,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:11,680 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:48:11,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:11,681 INFO L142 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-22 12:48:11,681 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 144 transitions. cyclomatic complexity: 107 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-22 12:48:11,719 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 144 transitions. cyclomatic complexity: 107. 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 76 states and 197 transitions. Complement of second has 2 states. [2022-07-22 12:48:11,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:11,720 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-22 12:48:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 15 transitions. [2022-07-22 12:48:11,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:48:11,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:11,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 9 letters. Loop has 1 letters. [2022-07-22 12:48:11,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:11,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:48:11,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:11,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 197 transitions. [2022-07-22 12:48:11,723 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2022-07-22 12:48:11,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 68 states and 168 transitions. [2022-07-22 12:48:11,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2022-07-22 12:48:11,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2022-07-22 12:48:11,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 168 transitions. [2022-07-22 12:48:11,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:48:11,725 INFO L220 hiAutomatonCegarLoop]: Abstraction has 68 states and 168 transitions. [2022-07-22 12:48:11,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 168 transitions. [2022-07-22 12:48:11,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2022-07-22 12:48:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.3392857142857144) internal successors, (131), 55 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 131 transitions. [2022-07-22 12:48:11,731 INFO L242 hiAutomatonCegarLoop]: Abstraction has 56 states and 131 transitions. [2022-07-22 12:48:11,731 INFO L425 stractBuchiCegarLoop]: Abstraction has 56 states and 131 transitions. [2022-07-22 12:48:11,731 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 12:48:11,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 131 transitions. [2022-07-22 12:48:11,732 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 10 [2022-07-22 12:48:11,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:11,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:11,733 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:48:11,733 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:48:11,733 INFO L748 eck$LassoCheckResult]: Stem: 1806#[ULTIMATE.startENTRY]don't care [330] ULTIMATE.startENTRY-->L70-3: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| 0)) (= |v_#NULL.base_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= 2 (select |v_#length_66| 1)) (= |v_#length_65| (store (store |v_#length_66| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4)) (< 0 |v_#StackHeapBarrier_22|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_104|) (= (select |v_#valid_105| 1) 1) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre7#1_35|))) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_main_#t~pre7#1_35| |v_#pthreadsForks_40|) (= 25 (select |v_#length_66| 2)) (= (ite (and (<= 0 v_~N1~0_49) (<= 0 v_~N2~0_45)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_41| 0) (= (select |v_#valid_105| 0) 0) (= (select |v_#valid_105| 2) 1) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_10| 0) (= (select |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= v_~counter~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_44|, #length=|v_#length_66|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, #NULL.offset=|v_#NULL.offset_10|, ~N2~0=v_~N2~0_45, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_24|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_49|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_26|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_35|, #length=|v_#length_65|, ~counter~0=v_~counter~0_80, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_17|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_40|, ~N1~0=v_~N1~0_49, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_22|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ~N2~0, ~N1~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem12#1, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, #valid, #memory_int, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1808#[L70-3]don't care [249] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, 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|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, 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] 1800#[thread1ENTRY, L70-4]don't care [224] 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] 1802#[L41-4, L70-4]don't care [305] L70-4-->L71-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre9#1_17| |v_#pthreadsForks_20|) (= (select |v_#valid_60| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre9#1_17|)))) InVars {#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_22|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{#pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_11|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_21|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet8#1, #memory_int, ULTIMATE.start_main_#t~pre7#1] 1838#[L71-3, L41-4]don't care [246] L71-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#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|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, 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, 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] 1850#[thread2ENTRY, L41-4, L71-4]don't care [234] 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] 1856#[L41-4, L51-4, L71-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 1874#[L41-4, L51-4, L71-4]don't care [2022-07-22 12:48:11,734 INFO L750 eck$LassoCheckResult]: Loop: 1874#[L41-4, L51-4, L71-4]don't care [313] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_24| 1) |v_thread2Thread1of1ForFork0_~i~1#1_23|) (< |v_thread2Thread1of1ForFork0_~i~1#1_24| v_~N2~0_29) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 v_~counter~0_73) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_73 (+ v_~counter~0_72 1))) InVars {~counter~0=v_~counter~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_24|, ~N2~0=v_~N2~0_29} OutVars{~counter~0=v_~counter~0_72, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N2~0=v_~N2~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_9|} 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] 1898#[L41-4, L51-4, L71-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 1874#[L41-4, L51-4, L71-4]don't care [2022-07-22 12:48:11,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:11,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1316171870, now seen corresponding path program 5 times [2022-07-22 12:48:11,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:11,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871280630] [2022-07-22 12:48:11,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:11,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:11,752 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:11,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:11,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:11,768 INFO L85 PathProgramCache]: Analyzing trace with hash 10971, now seen corresponding path program 1 times [2022-07-22 12:48:11,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:11,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518653243] [2022-07-22 12:48:11,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:11,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:11,774 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:11,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:11,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:11,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2120792056, now seen corresponding path program 1 times [2022-07-22 12:48:11,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:11,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113435666] [2022-07-22 12:48:11,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:11,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:11,793 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:11,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:11,890 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:11,890 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:11,890 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:11,891 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:11,891 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:48:11,891 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:11,891 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:11,891 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:11,891 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration8_Loop [2022-07-22 12:48:11,891 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:11,891 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:11,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:11,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:11,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:11,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:11,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:11,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:11,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:11,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:11,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:11,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:11,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:11,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,005 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:12,005 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:48:12,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:12,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:12,008 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:12,010 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:12,010 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:12,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-07-22 12:48:12,029 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:12,029 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-22 12:48:12,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2022-07-22 12:48:12,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:12,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:12,061 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:12,063 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:12,063 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:12,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2022-07-22 12:48:12,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:12,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:12,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:12,098 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:12,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-07-22 12:48:12,100 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:48:12,100 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:12,258 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:48:12,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2022-07-22 12:48:12,261 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:12,261 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:12,261 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:12,262 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:12,262 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:48:12,262 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:12,262 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:12,262 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:12,262 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration8_Loop [2022-07-22 12:48:12,262 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:12,262 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:12,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,377 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:12,377 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:48:12,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:12,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:12,379 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:12,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-07-22 12:48:12,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:12,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:12,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:12,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:12,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:12,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:12,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:12,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:12,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:12,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2022-07-22 12:48:12,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:12,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:12,416 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:12,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2022-07-22 12:48:12,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:12,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:12,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:12,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:12,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:12,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:12,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:12,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:12,438 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:48:12,442 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:48:12,442 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:48:12,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:12,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:12,443 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:12,444 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:48:12,445 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:48:12,445 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:48:12,445 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N2~0, thread2Thread1of1ForFork0_~i~1#1) = 1*~N2~0 - 1*thread2Thread1of1ForFork0_~i~1#1 Supporting invariants [] [2022-07-22 12:48:12,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-07-22 12:48:12,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:12,468 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:48:12,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:12,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:12,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:12,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:48:12,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:12,533 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:48:12,534 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 131 transitions. cyclomatic complexity: 92 Second operand has 3 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-22 12:48:12,559 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 131 transitions. cyclomatic complexity: 92. Second operand has 3 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) Result 75 states and 193 transitions. Complement of second has 3 states. [2022-07-22 12:48:12,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:12,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 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-22 12:48:12,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 9 transitions. [2022-07-22 12:48:12,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:48:12,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:12,561 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:48:12,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:12,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:12,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:12,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:48:12,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:12,621 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:48:12,621 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 131 transitions. cyclomatic complexity: 92 Second operand has 3 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-22 12:48:12,671 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 131 transitions. cyclomatic complexity: 92. Second operand has 3 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) Result 90 states and 232 transitions. Complement of second has 5 states. [2022-07-22 12:48:12,672 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-22 12:48:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 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-22 12:48:12,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-07-22 12:48:12,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:48:12,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:12,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-22 12:48:12,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:12,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-22 12:48:12,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:12,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 232 transitions. [2022-07-22 12:48:12,676 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 16 [2022-07-22 12:48:12,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 86 states and 220 transitions. [2022-07-22 12:48:12,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2022-07-22 12:48:12,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2022-07-22 12:48:12,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 220 transitions. [2022-07-22 12:48:12,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:48:12,678 INFO L220 hiAutomatonCegarLoop]: Abstraction has 86 states and 220 transitions. [2022-07-22 12:48:12,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 220 transitions. [2022-07-22 12:48:12,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2022-07-22 12:48:12,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 2.5441176470588234) internal successors, (173), 67 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 173 transitions. [2022-07-22 12:48:12,684 INFO L242 hiAutomatonCegarLoop]: Abstraction has 68 states and 173 transitions. [2022-07-22 12:48:12,684 INFO L425 stractBuchiCegarLoop]: Abstraction has 68 states and 173 transitions. [2022-07-22 12:48:12,684 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 12:48:12,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 173 transitions. [2022-07-22 12:48:12,685 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 12 [2022-07-22 12:48:12,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:12,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:12,686 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:48:12,686 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:48:12,687 INFO L748 eck$LassoCheckResult]: Stem: 2159#[ULTIMATE.startENTRY]don't care [330] ULTIMATE.startENTRY-->L70-3: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| 0)) (= |v_#NULL.base_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= 2 (select |v_#length_66| 1)) (= |v_#length_65| (store (store |v_#length_66| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4)) (< 0 |v_#StackHeapBarrier_22|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_104|) (= (select |v_#valid_105| 1) 1) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre7#1_35|))) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_main_#t~pre7#1_35| |v_#pthreadsForks_40|) (= 25 (select |v_#length_66| 2)) (= (ite (and (<= 0 v_~N1~0_49) (<= 0 v_~N2~0_45)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_41| 0) (= (select |v_#valid_105| 0) 0) (= (select |v_#valid_105| 2) 1) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_10| 0) (= (select |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= v_~counter~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_44|, #length=|v_#length_66|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, #NULL.offset=|v_#NULL.offset_10|, ~N2~0=v_~N2~0_45, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_24|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_49|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_26|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_35|, #length=|v_#length_65|, ~counter~0=v_~counter~0_80, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_17|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_40|, ~N1~0=v_~N1~0_49, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_22|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ~N2~0, ~N1~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem12#1, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, #valid, #memory_int, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2161#[L70-3]don't care [249] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, 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|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, 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] 2153#[thread1ENTRY, L70-4]don't care [224] 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] 2155#[L41-4, L70-4]don't care [305] L70-4-->L71-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre9#1_17| |v_#pthreadsForks_20|) (= (select |v_#valid_60| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre9#1_17|)))) InVars {#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_22|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{#pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_11|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_21|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet8#1, #memory_int, ULTIMATE.start_main_#t~pre7#1] 2193#[L71-3, L41-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 2225#[L71-3, L41-4]don't care [246] L71-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#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|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, 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, 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] 2245#[thread2ENTRY, L41-4, L71-4]don't care [234] 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] 2249#[L41-4, L51-4, L71-4]don't care [304] L71-4-->L72-1: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_19|) (select |v_#length_39| |v_ULTIMATE.start_main_~#t1~0#1.base_21|)) (= (select |v_#valid_58| |v_ULTIMATE.start_main_~#t1~0#1.base_21|) 1) (= (select (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t1~0#1.base_21|) |v_ULTIMATE.start_main_~#t1~0#1.offset_19|) |v_ULTIMATE.start_main_#t~mem11#1_14|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_19|)) InVars {#valid=|v_#valid_58|, #memory_int=|v_#memory_int_19|, #length=|v_#length_39|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_19|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_9|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, #valid=|v_#valid_58|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_14|, #memory_int=|v_#memory_int_19|, #length=|v_#length_39|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~mem11#1] 2257#[L41-4, L51-4, L72-1]don't care [2022-07-22 12:48:12,687 INFO L750 eck$LassoCheckResult]: Loop: 2257#[L41-4, L51-4, L72-1]don't care [313] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_24| 1) |v_thread2Thread1of1ForFork0_~i~1#1_23|) (< |v_thread2Thread1of1ForFork0_~i~1#1_24| v_~N2~0_29) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 v_~counter~0_73) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_73 (+ v_~counter~0_72 1))) InVars {~counter~0=v_~counter~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_24|, ~N2~0=v_~N2~0_29} OutVars{~counter~0=v_~counter~0_72, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N2~0=v_~N2~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_9|} 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] 2279#[L41-4, L51-4, L72-1]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 2257#[L41-4, L51-4, L72-1]don't care [2022-07-22 12:48:12,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:12,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2146518166, now seen corresponding path program 1 times [2022-07-22 12:48:12,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:12,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442947865] [2022-07-22 12:48:12,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:12,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:12,702 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:12,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:12,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:12,716 INFO L85 PathProgramCache]: Analyzing trace with hash 10971, now seen corresponding path program 2 times [2022-07-22 12:48:12,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:12,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088884403] [2022-07-22 12:48:12,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:12,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:12,721 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:12,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:12,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:12,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1219645436, now seen corresponding path program 1 times [2022-07-22 12:48:12,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:12,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224528116] [2022-07-22 12:48:12,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:12,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:12,741 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:12,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:12,842 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:12,842 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:12,842 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:12,842 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:12,842 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:48:12,842 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:12,842 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:12,843 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:12,843 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration9_Loop [2022-07-22 12:48:12,843 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:12,843 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:12,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:12,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:12,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:12,963 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:12,963 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:48:12,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:12,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:12,969 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:12,971 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:12,971 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:12,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-07-22 12:48:12,991 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:12,991 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_#t~post3#1=0} Honda state: {thread2Thread1of1ForFork0_#t~post3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:13,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:13,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:13,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:13,027 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:13,029 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:13,029 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:13,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-07-22 12:48:13,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:13,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:13,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:13,075 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:13,077 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:48:13,077 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:13,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-07-22 12:48:13,235 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:48:13,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:13,238 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:13,238 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:13,238 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:13,238 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:13,238 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:48:13,238 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:13,239 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:13,239 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:13,239 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration9_Loop [2022-07-22 12:48:13,239 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:13,239 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:13,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,376 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:13,376 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:48:13,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:13,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:13,378 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:13,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2022-07-22 12:48:13,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:13,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:13,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:13,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:13,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:13,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:13,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:13,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:13,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:13,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:13,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:13,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:13,412 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:13,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-07-22 12:48:13,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:13,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:13,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:13,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:13,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:13,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:13,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:13,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:13,425 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:48:13,429 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:48:13,429 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:48:13,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:13,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:13,431 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:13,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2022-07-22 12:48:13,433 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:48:13,433 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:48:13,433 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:48:13,433 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~i~1#1, ~N2~0) = -1*thread2Thread1of1ForFork0_~i~1#1 + 1*~N2~0 Supporting invariants [] [2022-07-22 12:48:13,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2022-07-22 12:48:13,456 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:48:13,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:13,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:13,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:13,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:48:13,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:13,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:13,527 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:48:13,527 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 173 transitions. cyclomatic complexity: 126 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-22 12:48:13,561 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 173 transitions. cyclomatic complexity: 126. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 89 states and 222 transitions. Complement of second has 3 states. [2022-07-22 12:48:13,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-22 12:48:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 11 transitions. [2022-07-22 12:48:13,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:48:13,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:13,563 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:48:13,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:13,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:13,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:13,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:48:13,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:13,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:13,628 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:48:13,628 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 173 transitions. cyclomatic complexity: 126 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-22 12:48:13,666 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 173 transitions. cyclomatic complexity: 126. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 103 states and 257 transitions. Complement of second has 5 states. [2022-07-22 12:48:13,667 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-22 12:48:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-22 12:48:13,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-07-22 12:48:13,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:48:13,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:13,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 2 letters. [2022-07-22 12:48:13,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:13,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 8 letters. Loop has 4 letters. [2022-07-22 12:48:13,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:13,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 257 transitions. [2022-07-22 12:48:13,670 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 17 [2022-07-22 12:48:13,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 97 states and 240 transitions. [2022-07-22 12:48:13,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2022-07-22 12:48:13,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2022-07-22 12:48:13,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 240 transitions. [2022-07-22 12:48:13,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:48:13,673 INFO L220 hiAutomatonCegarLoop]: Abstraction has 97 states and 240 transitions. [2022-07-22 12:48:13,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 240 transitions. [2022-07-22 12:48:13,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 68. [2022-07-22 12:48:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 2.5441176470588234) internal successors, (173), 67 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:13,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 173 transitions. [2022-07-22 12:48:13,679 INFO L242 hiAutomatonCegarLoop]: Abstraction has 68 states and 173 transitions. [2022-07-22 12:48:13,679 INFO L425 stractBuchiCegarLoop]: Abstraction has 68 states and 173 transitions. [2022-07-22 12:48:13,679 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 12:48:13,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 173 transitions. [2022-07-22 12:48:13,680 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 12 [2022-07-22 12:48:13,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:13,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:13,681 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-22 12:48:13,681 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:48:13,682 INFO L748 eck$LassoCheckResult]: Stem: 2569#[ULTIMATE.startENTRY]don't care [330] ULTIMATE.startENTRY-->L70-3: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| 0)) (= |v_#NULL.base_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= 2 (select |v_#length_66| 1)) (= |v_#length_65| (store (store |v_#length_66| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4)) (< 0 |v_#StackHeapBarrier_22|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_104|) (= (select |v_#valid_105| 1) 1) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre7#1_35|))) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_main_#t~pre7#1_35| |v_#pthreadsForks_40|) (= 25 (select |v_#length_66| 2)) (= (ite (and (<= 0 v_~N1~0_49) (<= 0 v_~N2~0_45)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_41| 0) (= (select |v_#valid_105| 0) 0) (= (select |v_#valid_105| 2) 1) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_10| 0) (= (select |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= v_~counter~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_44|, #length=|v_#length_66|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, #NULL.offset=|v_#NULL.offset_10|, ~N2~0=v_~N2~0_45, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_24|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_49|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_26|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_35|, #length=|v_#length_65|, ~counter~0=v_~counter~0_80, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_17|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_40|, ~N1~0=v_~N1~0_49, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_22|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ~N2~0, ~N1~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem12#1, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, #valid, #memory_int, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2571#[L70-3]don't care [249] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, 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|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, 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] 2563#[thread1ENTRY, L70-4]don't care [224] 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] 2565#[L41-4, L70-4]don't care [305] L70-4-->L71-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre9#1_17| |v_#pthreadsForks_20|) (= (select |v_#valid_60| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre9#1_17|)))) InVars {#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_22|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{#pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_11|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_21|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet8#1, #memory_int, ULTIMATE.start_main_#t~pre7#1] 2603#[L71-3, L41-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 2633#[L71-3, L41-4]don't care [246] L71-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#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|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, 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, 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] 2649#[thread2ENTRY, L41-4, L71-4]don't care [234] 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] 2653#[L41-4, L51-4, L71-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 2659#[L41-4, L51-4, L71-4]don't care [2022-07-22 12:48:13,682 INFO L750 eck$LassoCheckResult]: Loop: 2659#[L41-4, L51-4, L71-4]don't care [313] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_24| 1) |v_thread2Thread1of1ForFork0_~i~1#1_23|) (< |v_thread2Thread1of1ForFork0_~i~1#1_24| v_~N2~0_29) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 v_~counter~0_73) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_73 (+ v_~counter~0_72 1))) InVars {~counter~0=v_~counter~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_24|, ~N2~0=v_~N2~0_29} OutVars{~counter~0=v_~counter~0_72, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N2~0=v_~N2~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_9|} 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] 2681#[L41-4, L51-4, L71-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 2659#[L41-4, L51-4, L71-4]don't care [2022-07-22 12:48:13,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:13,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2146518163, now seen corresponding path program 6 times [2022-07-22 12:48:13,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:13,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249797836] [2022-07-22 12:48:13,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:13,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:13,693 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:13,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:13,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:13,706 INFO L85 PathProgramCache]: Analyzing trace with hash 10971, now seen corresponding path program 3 times [2022-07-22 12:48:13,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:13,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607645826] [2022-07-22 12:48:13,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:13,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:13,711 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:13,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:13,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:13,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1219642553, now seen corresponding path program 2 times [2022-07-22 12:48:13,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:13,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221611587] [2022-07-22 12:48:13,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:13,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:13,730 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:13,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:13,811 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:13,811 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:13,811 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:13,811 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:13,811 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:48:13,812 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:13,812 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:13,812 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:13,812 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration10_Loop [2022-07-22 12:48:13,812 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:13,812 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:13,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:13,941 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:13,941 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:48:13,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:13,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:13,943 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:13,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2022-07-22 12:48:13,944 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:13,944 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:13,953 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:13,953 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_#t~post3#1=0} Honda state: {thread2Thread1of1ForFork0_#t~post3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:13,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:13,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:13,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:13,976 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:13,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2022-07-22 12:48:13,977 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:13,977 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:14,006 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:14,007 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_19=1} Honda state: {v_rep#funAddr~thread2.offset_19=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:14,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2022-07-22 12:48:14,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:14,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:14,038 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:14,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2022-07-22 12:48:14,039 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:14,039 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:14,052 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:14,052 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~counter~0=1} Honda state: {~counter~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:14,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:14,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:14,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:14,074 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:14,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2022-07-22 12:48:14,076 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:14,076 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:14,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2022-07-22 12:48:14,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:14,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:14,107 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:14,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2022-07-22 12:48:14,108 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:48:14,108 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:14,267 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:48:14,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2022-07-22 12:48:14,269 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:14,269 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:14,270 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:14,270 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:14,270 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:48:14,270 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:14,270 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:14,270 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:14,270 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration10_Loop [2022-07-22 12:48:14,270 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:14,270 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:14,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:14,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:14,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:14,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:14,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:14,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:14,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:14,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:14,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:14,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:14,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:14,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:14,387 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:14,387 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:48:14,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:14,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:14,389 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:14,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2022-07-22 12:48:14,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:14,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:14,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:14,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:14,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:14,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:14,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:14,408 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:14,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:14,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:14,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:14,430 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:14,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2022-07-22 12:48:14,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:14,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:14,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:14,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:14,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:14,440 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:14,440 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:14,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:14,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:14,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:14,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:14,466 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:14,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2022-07-22 12:48:14,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:14,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:14,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:14,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:14,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:14,476 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:14,476 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:14,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:14,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:14,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:14,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:14,506 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:14,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2022-07-22 12:48:14,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:14,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:14,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:14,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:14,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:14,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:14,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:14,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:14,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:14,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2022-07-22 12:48:14,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:14,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:14,541 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:14,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2022-07-22 12:48:14,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:14,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:14,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:14,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:14,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:14,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:14,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:14,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:14,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:14,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2022-07-22 12:48:14,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:14,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:14,574 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:14,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2022-07-22 12:48:14,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:14,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:14,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:14,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:14,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:14,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:14,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:14,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:14,585 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:48:14,587 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:48:14,588 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:48:14,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:14,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:14,589 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:14,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2022-07-22 12:48:14,590 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:48:14,590 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:48:14,590 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:48:14,590 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N2~0, thread2Thread1of1ForFork0_~i~1#1) = 1*~N2~0 - 1*thread2Thread1of1ForFork0_~i~1#1 Supporting invariants [] [2022-07-22 12:48:14,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:14,614 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:48:14,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:14,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:14,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:14,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:48:14,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:14,687 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:48:14,687 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 173 transitions. cyclomatic complexity: 126 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-22 12:48:14,712 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 173 transitions. cyclomatic complexity: 126. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 91 states and 242 transitions. Complement of second has 3 states. [2022-07-22 12:48:14,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:14,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-22 12:48:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 9 transitions. [2022-07-22 12:48:14,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:48:14,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:14,713 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:48:14,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:14,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:14,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:14,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:48:14,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:14,778 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:48:14,779 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 173 transitions. cyclomatic complexity: 126 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-22 12:48:14,819 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 173 transitions. cyclomatic complexity: 126. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 104 states and 272 transitions. Complement of second has 5 states. [2022-07-22 12:48:14,819 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-22 12:48:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-22 12:48:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-07-22 12:48:14,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:48:14,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:14,820 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:48:14,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:14,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:14,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:14,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:48:14,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:14,877 INFO L142 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:48:14,877 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 173 transitions. cyclomatic complexity: 126 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-22 12:48:14,909 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 173 transitions. cyclomatic complexity: 126. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 100 states and 274 transitions. Complement of second has 3 states. [2022-07-22 12:48:14,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:14,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-22 12:48:14,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:48:14,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:48:14,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:14,911 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:48:14,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:14,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:14,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:14,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:48:14,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:14,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:14,971 INFO L142 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:48:14,972 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 173 transitions. cyclomatic complexity: 126 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-22 12:48:15,016 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 173 transitions. cyclomatic complexity: 126. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 119 states and 334 transitions. Complement of second has 5 states. [2022-07-22 12:48:15,016 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-22 12:48:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-22 12:48:15,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-07-22 12:48:15,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:48:15,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:15,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 10 letters. Loop has 2 letters. [2022-07-22 12:48:15,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:15,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 4 letters. [2022-07-22 12:48:15,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:15,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 334 transitions. [2022-07-22 12:48:15,023 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 25 [2022-07-22 12:48:15,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 105 states and 287 transitions. [2022-07-22 12:48:15,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2022-07-22 12:48:15,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2022-07-22 12:48:15,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 287 transitions. [2022-07-22 12:48:15,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:48:15,026 INFO L220 hiAutomatonCegarLoop]: Abstraction has 105 states and 287 transitions. [2022-07-22 12:48:15,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 287 transitions. [2022-07-22 12:48:15,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 62. [2022-07-22 12:48:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.467741935483871) internal successors, (153), 61 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 153 transitions. [2022-07-22 12:48:15,037 INFO L242 hiAutomatonCegarLoop]: Abstraction has 62 states and 153 transitions. [2022-07-22 12:48:15,037 INFO L425 stractBuchiCegarLoop]: Abstraction has 62 states and 153 transitions. [2022-07-22 12:48:15,037 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-22 12:48:15,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 153 transitions. [2022-07-22 12:48:15,038 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 14 [2022-07-22 12:48:15,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:15,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:15,040 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:48:15,040 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:48:15,041 INFO L748 eck$LassoCheckResult]: Stem: 3268#[ULTIMATE.startENTRY]don't care [330] ULTIMATE.startENTRY-->L70-3: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| 0)) (= |v_#NULL.base_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= 2 (select |v_#length_66| 1)) (= |v_#length_65| (store (store |v_#length_66| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4)) (< 0 |v_#StackHeapBarrier_22|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_104|) (= (select |v_#valid_105| 1) 1) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre7#1_35|))) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_main_#t~pre7#1_35| |v_#pthreadsForks_40|) (= 25 (select |v_#length_66| 2)) (= (ite (and (<= 0 v_~N1~0_49) (<= 0 v_~N2~0_45)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_41| 0) (= (select |v_#valid_105| 0) 0) (= (select |v_#valid_105| 2) 1) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_10| 0) (= (select |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= v_~counter~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_44|, #length=|v_#length_66|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, #NULL.offset=|v_#NULL.offset_10|, ~N2~0=v_~N2~0_45, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_24|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_49|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_26|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_35|, #length=|v_#length_65|, ~counter~0=v_~counter~0_80, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_17|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_40|, ~N1~0=v_~N1~0_49, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_22|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ~N2~0, ~N1~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem12#1, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, #valid, #memory_int, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3270#[L70-3]don't care [249] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, 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|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, 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] 3262#[thread1ENTRY, L70-4]don't care [224] 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] 3264#[L41-4, L70-4]don't care [305] L70-4-->L71-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre9#1_17| |v_#pthreadsForks_20|) (= (select |v_#valid_60| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre9#1_17|)))) InVars {#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_22|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{#pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_11|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_21|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet8#1, #memory_int, ULTIMATE.start_main_#t~pre7#1] 3300#[L71-3, L41-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 3334#[L71-3, L41-4]don't care [246] L71-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#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|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, 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, 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] 3348#[thread2ENTRY, L41-4, L71-4]don't care [234] 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] 3352#[L41-4, L51-4, L71-4]don't care [303] L41-4-->thread1EXIT: Formula: (and (not (< v_thread1Thread1of1ForFork1_~i~0_21 v_~N1~0_25)) (= |v_thread1Thread1of1ForFork1_#res.base_9| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_9| 0)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_21, ~N1~0=v_~N1~0_25} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_21, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_9|, ~N1~0=v_~N1~0_25} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] 3284#[L51-4, L71-4, thread1EXIT]don't care [2022-07-22 12:48:15,041 INFO L750 eck$LassoCheckResult]: Loop: 3284#[L51-4, L71-4, thread1EXIT]don't care [313] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_24| 1) |v_thread2Thread1of1ForFork0_~i~1#1_23|) (< |v_thread2Thread1of1ForFork0_~i~1#1_24| v_~N2~0_29) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 v_~counter~0_73) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_73 (+ v_~counter~0_72 1))) InVars {~counter~0=v_~counter~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_24|, ~N2~0=v_~N2~0_29} OutVars{~counter~0=v_~counter~0_72, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N2~0=v_~N2~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_9|} 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] 3284#[L51-4, L71-4, thread1EXIT]don't care [2022-07-22 12:48:15,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:15,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2146518167, now seen corresponding path program 1 times [2022-07-22 12:48:15,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:15,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810072969] [2022-07-22 12:48:15,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:15,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:15,055 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:15,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:15,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:15,089 INFO L85 PathProgramCache]: Analyzing trace with hash 344, now seen corresponding path program 2 times [2022-07-22 12:48:15,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:15,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492097857] [2022-07-22 12:48:15,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:15,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:15,092 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:15,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:15,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:15,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2117553424, now seen corresponding path program 1 times [2022-07-22 12:48:15,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:15,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183254774] [2022-07-22 12:48:15,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:15,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:15,106 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:15,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:15,153 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:15,153 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:15,153 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:15,153 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:15,153 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:48:15,153 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:15,154 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:15,154 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:15,154 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration11_Loop [2022-07-22 12:48:15,154 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:15,154 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:15,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:15,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:15,258 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:15,258 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:48:15,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:15,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:15,260 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:15,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2022-07-22 12:48:15,261 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:15,261 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:15,269 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:15,270 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-22 12:48:15,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2022-07-22 12:48:15,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:15,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:15,293 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:15,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2022-07-22 12:48:15,295 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:15,295 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:15,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:15,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:15,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:15,330 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:15,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2022-07-22 12:48:15,331 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:48:15,331 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:15,495 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:48:15,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2022-07-22 12:48:15,498 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:15,498 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:15,498 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:15,498 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:15,498 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:48:15,498 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:15,498 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:15,498 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:15,498 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration11_Loop [2022-07-22 12:48:15,499 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:15,499 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:15,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,591 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:15,591 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:48:15,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:15,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:15,593 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:15,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2022-07-22 12:48:15,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:15,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:15,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:15,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:15,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:15,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:15,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:15,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:15,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:15,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:15,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:15,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:15,633 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:15,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2022-07-22 12:48:15,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:15,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:15,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:15,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:15,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:15,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:15,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:15,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:15,645 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:48:15,648 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:48:15,648 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:48:15,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:15,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:15,649 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:15,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2022-07-22 12:48:15,651 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:48:15,651 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:48:15,651 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:48:15,651 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~i~1#1, ~N2~0) = -1*thread2Thread1of1ForFork0_~i~1#1 + 1*~N2~0 Supporting invariants [] [2022-07-22 12:48:15,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:15,673 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:48:15,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:15,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:15,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:15,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:48:15,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:15,725 INFO L142 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-22 12:48:15,725 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 153 transitions. cyclomatic complexity: 110 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-22 12:48:15,755 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 153 transitions. cyclomatic complexity: 110. 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 73 states and 173 transitions. Complement of second has 3 states. [2022-07-22 12:48:15,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:15,756 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-22 12:48:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 11 transitions. [2022-07-22 12:48:15,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:48:15,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:15,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 1 letters. [2022-07-22 12:48:15,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:15,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:48:15,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:15,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 173 transitions. [2022-07-22 12:48:15,758 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 13 [2022-07-22 12:48:15,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 173 transitions. [2022-07-22 12:48:15,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2022-07-22 12:48:15,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-07-22 12:48:15,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 173 transitions. [2022-07-22 12:48:15,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:48:15,760 INFO L220 hiAutomatonCegarLoop]: Abstraction has 73 states and 173 transitions. [2022-07-22 12:48:15,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 173 transitions. [2022-07-22 12:48:15,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 62. [2022-07-22 12:48:15,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.467741935483871) internal successors, (153), 61 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:15,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 153 transitions. [2022-07-22 12:48:15,776 INFO L242 hiAutomatonCegarLoop]: Abstraction has 62 states and 153 transitions. [2022-07-22 12:48:15,776 INFO L425 stractBuchiCegarLoop]: Abstraction has 62 states and 153 transitions. [2022-07-22 12:48:15,776 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-22 12:48:15,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 153 transitions. [2022-07-22 12:48:15,777 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 13 [2022-07-22 12:48:15,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:15,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:15,780 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:48:15,780 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:48:15,781 INFO L748 eck$LassoCheckResult]: Stem: 3508#[ULTIMATE.startENTRY]don't care [330] ULTIMATE.startENTRY-->L70-3: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| 0)) (= |v_#NULL.base_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= 2 (select |v_#length_66| 1)) (= |v_#length_65| (store (store |v_#length_66| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4)) (< 0 |v_#StackHeapBarrier_22|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_104|) (= (select |v_#valid_105| 1) 1) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre7#1_35|))) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_main_#t~pre7#1_35| |v_#pthreadsForks_40|) (= 25 (select |v_#length_66| 2)) (= (ite (and (<= 0 v_~N1~0_49) (<= 0 v_~N2~0_45)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_41| 0) (= (select |v_#valid_105| 0) 0) (= (select |v_#valid_105| 2) 1) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_10| 0) (= (select |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= v_~counter~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_44|, #length=|v_#length_66|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, #NULL.offset=|v_#NULL.offset_10|, ~N2~0=v_~N2~0_45, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_24|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_49|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_26|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_35|, #length=|v_#length_65|, ~counter~0=v_~counter~0_80, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_17|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_40|, ~N1~0=v_~N1~0_49, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_22|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ~N2~0, ~N1~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem12#1, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, #valid, #memory_int, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3510#[L70-3]don't care [249] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, 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|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, 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] 3496#[thread1ENTRY, L70-4]don't care [224] 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] 3498#[L41-4, L70-4]don't care [305] L70-4-->L71-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre9#1_17| |v_#pthreadsForks_20|) (= (select |v_#valid_60| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre9#1_17|)))) InVars {#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_22|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{#pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_11|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_21|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet8#1, #memory_int, ULTIMATE.start_main_#t~pre7#1] 3540#[L71-3, L41-4]don't care [246] L71-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#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|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, 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, 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] 3554#[thread2ENTRY, L41-4, L71-4]don't care [234] 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] 3560#[L41-4, L51-4, L71-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 3572#[L41-4, L51-4, L71-4]don't care [313] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_24| 1) |v_thread2Thread1of1ForFork0_~i~1#1_23|) (< |v_thread2Thread1of1ForFork0_~i~1#1_24| v_~N2~0_29) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 v_~counter~0_73) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_73 (+ v_~counter~0_72 1))) InVars {~counter~0=v_~counter~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_24|, ~N2~0=v_~N2~0_29} OutVars{~counter~0=v_~counter~0_72, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N2~0=v_~N2~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_9|} 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] 3592#[L41-4, L51-4, L71-4]don't care [2022-07-22 12:48:15,781 INFO L750 eck$LassoCheckResult]: Loop: 3592#[L41-4, L51-4, L71-4]don't care [313] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_24| 1) |v_thread2Thread1of1ForFork0_~i~1#1_23|) (< |v_thread2Thread1of1ForFork0_~i~1#1_24| v_~N2~0_29) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 v_~counter~0_73) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_73 (+ v_~counter~0_72 1))) InVars {~counter~0=v_~counter~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_24|, ~N2~0=v_~N2~0_29} OutVars{~counter~0=v_~counter~0_72, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N2~0=v_~N2~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_9|} 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] 3592#[L41-4, L51-4, L71-4]don't care [2022-07-22 12:48:15,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:15,781 INFO L85 PathProgramCache]: Analyzing trace with hash 2146622619, now seen corresponding path program 3 times [2022-07-22 12:48:15,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:15,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961019403] [2022-07-22 12:48:15,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:15,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:15,805 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:15,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:15,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:15,825 INFO L85 PathProgramCache]: Analyzing trace with hash 344, now seen corresponding path program 3 times [2022-07-22 12:48:15,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:15,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538643345] [2022-07-22 12:48:15,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:15,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:15,832 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:15,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:15,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:15,838 INFO L85 PathProgramCache]: Analyzing trace with hash 2120792062, now seen corresponding path program 4 times [2022-07-22 12:48:15,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:15,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119967540] [2022-07-22 12:48:15,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:15,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:15,876 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-22 12:48:15,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:48:15,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119967540] [2022-07-22 12:48:15,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119967540] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:48:15,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:48:15,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:48:15,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918805185] [2022-07-22 12:48:15,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:48:15,921 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:15,921 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:15,921 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:15,921 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:15,922 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:48:15,922 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:15,922 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:15,922 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:15,922 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration12_Loop [2022-07-22 12:48:15,922 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:15,922 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:15,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:15,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:16,008 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:16,008 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:48:16,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:16,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:16,009 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:16,016 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:16,016 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:16,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2022-07-22 12:48:16,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:16,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:16,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:16,072 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:16,074 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:48:16,074 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:16,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2022-07-22 12:48:16,257 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:48:16,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2022-07-22 12:48:16,260 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:16,260 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:16,260 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:16,260 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:16,260 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:48:16,260 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:16,261 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:16,261 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:16,261 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration12_Loop [2022-07-22 12:48:16,261 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:16,261 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:16,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:16,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:16,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:16,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:16,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:16,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:16,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:16,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:16,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:16,351 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:16,351 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:48:16,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:16,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:16,352 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:16,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2022-07-22 12:48:16,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:16,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:16,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:16,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:16,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:16,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:16,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:16,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:16,370 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:48:16,372 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:48:16,372 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:48:16,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:16,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:16,374 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:16,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2022-07-22 12:48:16,375 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:48:16,375 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:48:16,375 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:48:16,375 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~i~1#1, ~N2~0) = -1*thread2Thread1of1ForFork0_~i~1#1 + 1*~N2~0 Supporting invariants [] [2022-07-22 12:48:16,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2022-07-22 12:48:16,401 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:48:16,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:16,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:16,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:16,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:48:16,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:16,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:16,447 INFO L142 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-22 12:48:16,447 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 153 transitions. cyclomatic complexity: 109 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-22 12:48:16,476 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 153 transitions. cyclomatic complexity: 109. 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 100 states and 246 transitions. Complement of second has 3 states. [2022-07-22 12:48:16,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:16,477 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-22 12:48:16,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 13 transitions. [2022-07-22 12:48:16,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:48:16,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:16,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 9 letters. Loop has 1 letters. [2022-07-22 12:48:16,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:16,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:48:16,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:16,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 246 transitions. [2022-07-22 12:48:16,479 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 13 [2022-07-22 12:48:16,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 97 states and 241 transitions. [2022-07-22 12:48:16,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2022-07-22 12:48:16,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2022-07-22 12:48:16,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 241 transitions. [2022-07-22 12:48:16,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:48:16,482 INFO L220 hiAutomatonCegarLoop]: Abstraction has 97 states and 241 transitions. [2022-07-22 12:48:16,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 241 transitions. [2022-07-22 12:48:16,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2022-07-22 12:48:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 2.5128205128205128) internal successors, (196), 77 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:16,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 196 transitions. [2022-07-22 12:48:16,486 INFO L242 hiAutomatonCegarLoop]: Abstraction has 78 states and 196 transitions. [2022-07-22 12:48:16,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:48:16,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:48:16,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:48:16,487 INFO L87 Difference]: Start difference. First operand 78 states and 196 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-22 12:48:16,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:48:16,519 INFO L93 Difference]: Finished difference Result 137 states and 331 transitions. [2022-07-22 12:48:16,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 331 transitions. [2022-07-22 12:48:16,522 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 13 [2022-07-22 12:48:16,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 105 states and 253 transitions. [2022-07-22 12:48:16,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2022-07-22 12:48:16,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2022-07-22 12:48:16,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 253 transitions. [2022-07-22 12:48:16,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:48:16,525 INFO L220 hiAutomatonCegarLoop]: Abstraction has 105 states and 253 transitions. [2022-07-22 12:48:16,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 253 transitions. [2022-07-22 12:48:16,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2022-07-22 12:48:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 2.4134615384615383) internal successors, (251), 103 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:16,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 251 transitions. [2022-07-22 12:48:16,529 INFO L242 hiAutomatonCegarLoop]: Abstraction has 104 states and 251 transitions. [2022-07-22 12:48:16,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:48:16,530 INFO L425 stractBuchiCegarLoop]: Abstraction has 104 states and 251 transitions. [2022-07-22 12:48:16,530 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-22 12:48:16,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 251 transitions. [2022-07-22 12:48:16,531 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 13 [2022-07-22 12:48:16,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:16,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:16,532 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:48:16,532 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1] [2022-07-22 12:48:16,533 INFO L748 eck$LassoCheckResult]: Stem: 4070#[ULTIMATE.startENTRY]don't care [330] ULTIMATE.startENTRY-->L70-3: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| 0)) (= |v_#NULL.base_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= 2 (select |v_#length_66| 1)) (= |v_#length_65| (store (store |v_#length_66| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4)) (< 0 |v_#StackHeapBarrier_22|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_104|) (= (select |v_#valid_105| 1) 1) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre7#1_35|))) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_main_#t~pre7#1_35| |v_#pthreadsForks_40|) (= 25 (select |v_#length_66| 2)) (= (ite (and (<= 0 v_~N1~0_49) (<= 0 v_~N2~0_45)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_41| 0) (= (select |v_#valid_105| 0) 0) (= (select |v_#valid_105| 2) 1) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_10| 0) (= (select |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= v_~counter~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_44|, #length=|v_#length_66|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, #NULL.offset=|v_#NULL.offset_10|, ~N2~0=v_~N2~0_45, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_24|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_49|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_26|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_35|, #length=|v_#length_65|, ~counter~0=v_~counter~0_80, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_17|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_40|, ~N1~0=v_~N1~0_49, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_22|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ~N2~0, ~N1~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem12#1, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, #valid, #memory_int, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4072#[L70-3]don't care [249] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, 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|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, 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] 4058#[thread1ENTRY, L70-4]don't care [224] 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] 4060#[L41-4, L70-4]don't care [305] L70-4-->L71-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre9#1_17| |v_#pthreadsForks_20|) (= (select |v_#valid_60| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre9#1_17|)))) InVars {#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_22|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{#pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_11|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_21|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet8#1, #memory_int, ULTIMATE.start_main_#t~pre7#1] 4108#[L71-3, L41-4]don't care [246] L71-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#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|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, 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, 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] 4126#[thread2ENTRY, L41-4, L71-4]don't care [234] 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] 4132#[L41-4, L51-4, L71-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 4236#[L41-4, L51-4, L71-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 4212#[L41-4, L51-4, L71-4]don't care [313] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_24| 1) |v_thread2Thread1of1ForFork0_~i~1#1_23|) (< |v_thread2Thread1of1ForFork0_~i~1#1_24| v_~N2~0_29) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 v_~counter~0_73) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_73 (+ v_~counter~0_72 1))) InVars {~counter~0=v_~counter~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_24|, ~N2~0=v_~N2~0_29} OutVars{~counter~0=v_~counter~0_72, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N2~0=v_~N2~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_9|} 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] 4200#[L41-4, L51-4, L71-4]don't care [2022-07-22 12:48:16,533 INFO L750 eck$LassoCheckResult]: Loop: 4200#[L41-4, L51-4, L71-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 4254#[L41-4, L51-4, L71-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 4256#[L41-4, L51-4, L71-4]don't care [313] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_24| 1) |v_thread2Thread1of1ForFork0_~i~1#1_23|) (< |v_thread2Thread1of1ForFork0_~i~1#1_24| v_~N2~0_29) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 v_~counter~0_73) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_73 (+ v_~counter~0_72 1))) InVars {~counter~0=v_~counter~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_24|, ~N2~0=v_~N2~0_29} OutVars{~counter~0=v_~counter~0_72, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N2~0=v_~N2~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_9|} 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] 4200#[L41-4, L51-4, L71-4]don't care [2022-07-22 12:48:16,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:16,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2120791876, now seen corresponding path program 5 times [2022-07-22 12:48:16,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:16,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54656593] [2022-07-22 12:48:16,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:16,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:16,545 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:16,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:16,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:16,558 INFO L85 PathProgramCache]: Analyzing trace with hash 334648, now seen corresponding path program 4 times [2022-07-22 12:48:16,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:16,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49955145] [2022-07-22 12:48:16,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:16,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:16,563 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:16,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:16,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:16,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1542158613, now seen corresponding path program 6 times [2022-07-22 12:48:16,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:16,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856112376] [2022-07-22 12:48:16,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:16,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:16,580 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:16,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:16,678 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:16,679 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:16,679 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:16,679 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:16,679 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:48:16,679 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:16,679 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:16,679 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:16,680 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration13_Loop [2022-07-22 12:48:16,680 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:16,680 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:16,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:16,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:16,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:16,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:16,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:16,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:16,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:16,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:16,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:16,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:16,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:16,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:16,790 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:16,791 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:48:16,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:16,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:16,793 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:16,796 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:16,796 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:16,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2022-07-22 12:48:16,818 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:16,818 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-22 12:48:16,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:16,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:16,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:16,855 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:16,859 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:16,860 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:16,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2022-07-22 12:48:16,880 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:16,880 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_#t~post3#1=0} Honda state: {thread2Thread1of1ForFork0_#t~post3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:16,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:16,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:16,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:16,919 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:16,921 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:16,921 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:16,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2022-07-22 12:48:16,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:16,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:16,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:16,978 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:16,980 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:48:16,980 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:16,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2022-07-22 12:48:17,003 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:17,003 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~counter~0=-1} Honda state: {~counter~0=-1} Generalized eigenvectors: [{~counter~0=1}, {~counter~0=0}, {~counter~0=0}] Lambdas: [1, 0, 8] Nus: [0, 0] [2022-07-22 12:48:17,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2022-07-22 12:48:17,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:17,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:17,027 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:17,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2022-07-22 12:48:17,030 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:17,030 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:17,045 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:17,046 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-22 12:48:17,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2022-07-22 12:48:17,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:17,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:17,069 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:17,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2022-07-22 12:48:17,071 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:17,072 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:17,089 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:17,089 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_25=-1} Honda state: {v_rep#funAddr~thread1.base_25=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:17,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2022-07-22 12:48:17,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:17,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:17,122 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:17,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2022-07-22 12:48:17,124 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:17,125 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:17,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:17,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:17,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:17,158 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:17,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2022-07-22 12:48:17,162 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:48:17,162 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:17,293 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:48:17,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:17,297 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:17,297 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:17,297 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:17,297 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:17,297 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:48:17,297 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:17,297 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:17,297 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:17,297 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration13_Loop [2022-07-22 12:48:17,297 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:17,297 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:17,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:17,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:17,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:17,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:17,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:17,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:17,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:17,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:17,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:17,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:17,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:17,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:17,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:17,430 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:17,430 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:48:17,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:17,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:17,432 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:17,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:17,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:17,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:17,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:17,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:17,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:17,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:17,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:17,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2022-07-22 12:48:17,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:17,456 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:17,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2022-07-22 12:48:17,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:17,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:17,479 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:17,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2022-07-22 12:48:17,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:17,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:17,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:17,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:17,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:17,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:17,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:17,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:17,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:17,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2022-07-22 12:48:17,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:17,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:17,515 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:17,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2022-07-22 12:48:17,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:17,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:17,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:17,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:17,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:17,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:17,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:17,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:17,526 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:17,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:17,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:17,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:17,548 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:17,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2022-07-22 12:48:17,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:17,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:17,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:17,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:17,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:17,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:17,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:17,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:17,560 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:48:17,563 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:48:17,563 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:48:17,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:17,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:17,564 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:17,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2022-07-22 12:48:17,566 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:48:17,566 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:48:17,566 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:48:17,567 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N1~0, thread1Thread1of1ForFork1_~i~0) = 1*~N1~0 - 1*thread1Thread1of1ForFork1_~i~0 Supporting invariants [] [2022-07-22 12:48:17,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:17,592 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:48:17,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:17,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:17,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:17,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:48:17,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:17,671 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-22 12:48:17,671 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-22 12:48:17,672 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 104 states and 251 transitions. cyclomatic complexity: 171 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:17,703 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 104 states and 251 transitions. cyclomatic complexity: 171. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 150 states and 377 transitions. Complement of second has 3 states. [2022-07-22 12:48:17,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:17,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:48:17,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2022-07-22 12:48:17,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:17,705 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:48:17,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:17,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:17,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:17,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:48:17,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:17,779 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-22 12:48:17,780 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-22 12:48:17,780 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 104 states and 251 transitions. cyclomatic complexity: 171 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:17,870 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 104 states and 251 transitions. cyclomatic complexity: 171. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 247 states and 614 transitions. Complement of second has 7 states. [2022-07-22 12:48:17,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:17,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-07-22 12:48:17,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 9 letters. Loop has 3 letters. [2022-07-22 12:48:17,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:17,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 12 letters. Loop has 3 letters. [2022-07-22 12:48:17,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:17,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 9 letters. Loop has 6 letters. [2022-07-22 12:48:17,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:17,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 247 states and 614 transitions. [2022-07-22 12:48:17,880 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 18 [2022-07-22 12:48:17,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 247 states to 209 states and 502 transitions. [2022-07-22 12:48:17,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2022-07-22 12:48:17,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2022-07-22 12:48:17,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 209 states and 502 transitions. [2022-07-22 12:48:17,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:48:17,883 INFO L220 hiAutomatonCegarLoop]: Abstraction has 209 states and 502 transitions. [2022-07-22 12:48:17,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 502 transitions. [2022-07-22 12:48:17,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 140. [2022-07-22 12:48:17,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 140 states have (on average 2.557142857142857) internal successors, (358), 139 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:17,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 358 transitions. [2022-07-22 12:48:17,893 INFO L242 hiAutomatonCegarLoop]: Abstraction has 140 states and 358 transitions. [2022-07-22 12:48:17,893 INFO L425 stractBuchiCegarLoop]: Abstraction has 140 states and 358 transitions. [2022-07-22 12:48:17,893 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-22 12:48:17,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 358 transitions. [2022-07-22 12:48:17,894 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 13 [2022-07-22 12:48:17,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:17,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:17,896 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:48:17,896 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:48:17,896 INFO L748 eck$LassoCheckResult]: Stem: 4775#[ULTIMATE.startENTRY]don't care [330] ULTIMATE.startENTRY-->L70-3: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| 0)) (= |v_#NULL.base_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= 2 (select |v_#length_66| 1)) (= |v_#length_65| (store (store |v_#length_66| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4)) (< 0 |v_#StackHeapBarrier_22|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_104|) (= (select |v_#valid_105| 1) 1) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre7#1_35|))) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_main_#t~pre7#1_35| |v_#pthreadsForks_40|) (= 25 (select |v_#length_66| 2)) (= (ite (and (<= 0 v_~N1~0_49) (<= 0 v_~N2~0_45)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_41| 0) (= (select |v_#valid_105| 0) 0) (= (select |v_#valid_105| 2) 1) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_10| 0) (= (select |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= v_~counter~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_44|, #length=|v_#length_66|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, #NULL.offset=|v_#NULL.offset_10|, ~N2~0=v_~N2~0_45, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_24|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_49|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_26|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_35|, #length=|v_#length_65|, ~counter~0=v_~counter~0_80, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_17|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_40|, ~N1~0=v_~N1~0_49, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_22|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ~N2~0, ~N1~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem12#1, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, #valid, #memory_int, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4777#[L70-3]don't care [249] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, 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|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, 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] 4769#[thread1ENTRY, L70-4]don't care [224] 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] 4771#[L41-4, L70-4]don't care [305] L70-4-->L71-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre9#1_17| |v_#pthreadsForks_20|) (= (select |v_#valid_60| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre9#1_17|)))) InVars {#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_22|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{#pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_11|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_21|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet8#1, #memory_int, ULTIMATE.start_main_#t~pre7#1] 4811#[L71-3, L41-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 4845#[L71-3, L41-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 4865#[L71-3, L41-4]don't care [246] L71-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#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|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, 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, 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] 4867#[thread2ENTRY, L41-4, L71-4]don't care [234] 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] 4883#[L41-4, L51-4, L71-4]don't care [313] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_24| 1) |v_thread2Thread1of1ForFork0_~i~1#1_23|) (< |v_thread2Thread1of1ForFork0_~i~1#1_24| v_~N2~0_29) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 v_~counter~0_73) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_73 (+ v_~counter~0_72 1))) InVars {~counter~0=v_~counter~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_24|, ~N2~0=v_~N2~0_29} OutVars{~counter~0=v_~counter~0_72, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N2~0=v_~N2~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_9|} 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] 4913#[L41-4, L51-4, L71-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 4853#[L41-4, L51-4, L71-4]don't care [2022-07-22 12:48:17,897 INFO L750 eck$LassoCheckResult]: Loop: 4853#[L41-4, L51-4, L71-4]don't care [313] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_24| 1) |v_thread2Thread1of1ForFork0_~i~1#1_23|) (< |v_thread2Thread1of1ForFork0_~i~1#1_24| v_~N2~0_29) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 v_~counter~0_73) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_73 (+ v_~counter~0_72 1))) InVars {~counter~0=v_~counter~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_24|, ~N2~0=v_~N2~0_29} OutVars{~counter~0=v_~counter~0_72, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N2~0=v_~N2~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_9|} 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] 4853#[L41-4, L51-4, L71-4]don't care [2022-07-22 12:48:17,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:17,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1163020433, now seen corresponding path program 7 times [2022-07-22 12:48:17,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:17,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203075415] [2022-07-22 12:48:17,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:17,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:17,914 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:17,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:17,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:17,950 INFO L85 PathProgramCache]: Analyzing trace with hash 344, now seen corresponding path program 4 times [2022-07-22 12:48:17,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:17,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940653975] [2022-07-22 12:48:17,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:17,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:17,955 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:17,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:17,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:17,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1693894742, now seen corresponding path program 8 times [2022-07-22 12:48:17,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:17,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756975749] [2022-07-22 12:48:17,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:17,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:17,977 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:17,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:18,036 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:18,036 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:18,036 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:18,036 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:18,036 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:48:18,037 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:18,037 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:18,037 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:18,037 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration14_Loop [2022-07-22 12:48:18,037 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:18,037 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:18,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,125 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:18,125 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:48:18,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:18,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:18,129 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:18,144 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:18,144 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:18,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2022-07-22 12:48:18,158 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:18,158 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_27=0} Honda state: {v_rep#funAddr~thread1.offset_27=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:18,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:18,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:18,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:18,181 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:18,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2022-07-22 12:48:18,182 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:18,183 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:18,191 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:18,191 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-22 12:48:18,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:18,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:18,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:18,215 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:18,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2022-07-22 12:48:18,216 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:18,216 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:18,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2022-07-22 12:48:18,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:18,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:18,248 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:18,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2022-07-22 12:48:18,249 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:48:18,249 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:18,285 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:48:18,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:18,288 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:18,288 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:18,288 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:18,288 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:18,288 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:48:18,288 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:18,288 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:18,288 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:18,288 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration14_Loop [2022-07-22 12:48:18,288 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:18,288 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:18,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,381 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:18,381 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:48:18,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:18,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:18,383 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:18,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2022-07-22 12:48:18,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:18,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:18,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:18,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:18,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:18,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:18,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:18,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:18,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:18,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2022-07-22 12:48:18,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:18,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:18,419 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:18,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2022-07-22 12:48:18,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:18,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:18,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:18,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:18,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:18,430 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:18,430 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:18,433 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:18,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2022-07-22 12:48:18,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:18,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:18,456 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:18,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2022-07-22 12:48:18,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:18,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:18,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:18,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:18,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:18,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:18,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:18,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:18,468 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:48:18,470 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:48:18,470 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:48:18,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:18,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:18,471 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:18,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2022-07-22 12:48:18,472 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:48:18,473 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:48:18,473 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:48:18,473 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~counter~0) = 1*~counter~0 Supporting invariants [] [2022-07-22 12:48:18,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2022-07-22 12:48:18,496 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:48:18,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:18,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:18,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:18,542 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 12:48:18,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:18,543 INFO L142 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-22 12:48:18,544 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 358 transitions. cyclomatic complexity: 251 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-22 12:48:18,574 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 358 transitions. cyclomatic complexity: 251. 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 152 states and 386 transitions. Complement of second has 3 states. [2022-07-22 12:48:18,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:18,575 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-22 12:48:18,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 9 transitions. [2022-07-22 12:48:18,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 10 letters. Loop has 1 letters. [2022-07-22 12:48:18,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:18,576 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:48:18,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:18,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:18,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:18,619 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 12:48:18,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:18,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:18,620 INFO L142 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-22 12:48:18,620 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 358 transitions. cyclomatic complexity: 251 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-22 12:48:18,638 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 358 transitions. cyclomatic complexity: 251. 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 152 states and 386 transitions. Complement of second has 3 states. [2022-07-22 12:48:18,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:18,639 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-22 12:48:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 9 transitions. [2022-07-22 12:48:18,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 10 letters. Loop has 1 letters. [2022-07-22 12:48:18,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:18,639 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:48:18,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:18,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:18,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:18,686 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 12:48:18,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:18,687 INFO L142 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-22 12:48:18,687 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 358 transitions. cyclomatic complexity: 251 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-22 12:48:18,714 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 358 transitions. cyclomatic complexity: 251. 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 234 states and 627 transitions. Complement of second has 3 states. [2022-07-22 12:48:18,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:18,715 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-22 12:48:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:48:18,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 10 letters. Loop has 1 letters. [2022-07-22 12:48:18,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:18,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 11 letters. Loop has 1 letters. [2022-07-22 12:48:18,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:18,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2022-07-22 12:48:18,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:18,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 234 states and 627 transitions. [2022-07-22 12:48:18,719 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2022-07-22 12:48:18,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 234 states to 234 states and 627 transitions. [2022-07-22 12:48:18,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2022-07-22 12:48:18,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2022-07-22 12:48:18,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 234 states and 627 transitions. [2022-07-22 12:48:18,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:48:18,723 INFO L220 hiAutomatonCegarLoop]: Abstraction has 234 states and 627 transitions. [2022-07-22 12:48:18,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states and 627 transitions. [2022-07-22 12:48:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 150. [2022-07-22 12:48:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 150 states have (on average 2.6133333333333333) internal successors, (392), 149 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:18,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 392 transitions. [2022-07-22 12:48:18,729 INFO L242 hiAutomatonCegarLoop]: Abstraction has 150 states and 392 transitions. [2022-07-22 12:48:18,730 INFO L425 stractBuchiCegarLoop]: Abstraction has 150 states and 392 transitions. [2022-07-22 12:48:18,730 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-22 12:48:18,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 392 transitions. [2022-07-22 12:48:18,732 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2022-07-22 12:48:18,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:18,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:18,732 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:48:18,732 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:48:18,733 INFO L748 eck$LassoCheckResult]: Stem: 5710#[ULTIMATE.startENTRY]don't care [330] ULTIMATE.startENTRY-->L70-3: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| 0)) (= |v_#NULL.base_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= 2 (select |v_#length_66| 1)) (= |v_#length_65| (store (store |v_#length_66| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4)) (< 0 |v_#StackHeapBarrier_22|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_104|) (= (select |v_#valid_105| 1) 1) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre7#1_35|))) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_main_#t~pre7#1_35| |v_#pthreadsForks_40|) (= 25 (select |v_#length_66| 2)) (= (ite (and (<= 0 v_~N1~0_49) (<= 0 v_~N2~0_45)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_41| 0) (= (select |v_#valid_105| 0) 0) (= (select |v_#valid_105| 2) 1) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_10| 0) (= (select |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= v_~counter~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_44|, #length=|v_#length_66|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, #NULL.offset=|v_#NULL.offset_10|, ~N2~0=v_~N2~0_45, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_24|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_49|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_26|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_35|, #length=|v_#length_65|, ~counter~0=v_~counter~0_80, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_17|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_40|, ~N1~0=v_~N1~0_49, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_22|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ~N2~0, ~N1~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem12#1, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, #valid, #memory_int, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5712#[L70-3]don't care [249] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, 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|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, 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] 5704#[thread1ENTRY, L70-4]don't care [224] 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] 5706#[L41-4, L70-4]don't care [305] L70-4-->L71-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre9#1_17| |v_#pthreadsForks_20|) (= (select |v_#valid_60| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre9#1_17|)))) InVars {#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_22|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{#pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_11|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_21|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet8#1, #memory_int, ULTIMATE.start_main_#t~pre7#1] 5744#[L71-3, L41-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 5782#[L71-3, L41-4]don't care [246] L71-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#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|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, 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, 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] 5876#[thread2ENTRY, L41-4, L71-4]don't care [234] 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] 5878#[L41-4, L51-4, L71-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 5840#[L41-4, L51-4, L71-4]don't care [313] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_24| 1) |v_thread2Thread1of1ForFork0_~i~1#1_23|) (< |v_thread2Thread1of1ForFork0_~i~1#1_24| v_~N2~0_29) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 v_~counter~0_73) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_73 (+ v_~counter~0_72 1))) InVars {~counter~0=v_~counter~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_24|, ~N2~0=v_~N2~0_29} OutVars{~counter~0=v_~counter~0_72, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N2~0=v_~N2~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_9|} 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] 5882#[L41-4, L51-4, L71-4]don't care [304] L71-4-->L72-1: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_19|) (select |v_#length_39| |v_ULTIMATE.start_main_~#t1~0#1.base_21|)) (= (select |v_#valid_58| |v_ULTIMATE.start_main_~#t1~0#1.base_21|) 1) (= (select (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t1~0#1.base_21|) |v_ULTIMATE.start_main_~#t1~0#1.offset_19|) |v_ULTIMATE.start_main_#t~mem11#1_14|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_19|)) InVars {#valid=|v_#valid_58|, #memory_int=|v_#memory_int_19|, #length=|v_#length_39|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_19|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_9|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, #valid=|v_#valid_58|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_14|, #memory_int=|v_#memory_int_19|, #length=|v_#length_39|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~mem11#1] 5872#[L41-4, L51-4, L72-1]don't care [2022-07-22 12:48:18,733 INFO L750 eck$LassoCheckResult]: Loop: 5872#[L41-4, L51-4, L72-1]don't care [313] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_24| 1) |v_thread2Thread1of1ForFork0_~i~1#1_23|) (< |v_thread2Thread1of1ForFork0_~i~1#1_24| v_~N2~0_29) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 v_~counter~0_73) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_73 (+ v_~counter~0_72 1))) InVars {~counter~0=v_~counter~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_24|, ~N2~0=v_~N2~0_29} OutVars{~counter~0=v_~counter~0_72, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N2~0=v_~N2~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_9|} 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] 5872#[L41-4, L51-4, L72-1]don't care [2022-07-22 12:48:18,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:18,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1219642556, now seen corresponding path program 2 times [2022-07-22 12:48:18,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:18,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891750620] [2022-07-22 12:48:18,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:18,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:18,746 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:18,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:18,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:18,759 INFO L85 PathProgramCache]: Analyzing trace with hash 344, now seen corresponding path program 5 times [2022-07-22 12:48:18,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:18,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42710137] [2022-07-22 12:48:18,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:18,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:18,763 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:18,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:18,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:18,767 INFO L85 PathProgramCache]: Analyzing trace with hash 845786741, now seen corresponding path program 3 times [2022-07-22 12:48:18,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:18,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993092561] [2022-07-22 12:48:18,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:18,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:18,779 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:18,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:18,838 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:18,838 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:18,838 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:18,838 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:18,838 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:48:18,838 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:18,838 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:18,839 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:18,839 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration15_Loop [2022-07-22 12:48:18,839 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:18,839 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:18,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:18,919 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:18,920 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:48:18,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:18,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:18,921 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:18,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2022-07-22 12:48:18,923 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:18,923 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:18,932 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:18,933 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-22 12:48:18,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2022-07-22 12:48:18,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:18,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:18,955 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:18,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2022-07-22 12:48:18,956 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:18,956 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:18,970 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:18,970 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_29=1} Honda state: {v_rep#funAddr~thread2.offset_29=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:18,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2022-07-22 12:48:18,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:18,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:18,995 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:18,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2022-07-22 12:48:18,996 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:18,996 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:19,010 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:19,011 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-22 12:48:19,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2022-07-22 12:48:19,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:19,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:19,034 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:19,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2022-07-22 12:48:19,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:19,036 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:19,050 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:19,050 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_29=0} Honda state: {v_rep#funAddr~thread1.offset_29=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:19,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:19,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:19,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:19,072 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:19,094 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:19,094 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:19,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2022-07-22 12:48:19,122 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:19,122 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_29=-1} Honda state: {v_rep#funAddr~thread2.base_29=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:19,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:19,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:19,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:19,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:19,154 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:19,156 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:19,156 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:19,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2022-07-22 12:48:19,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2022-07-22 12:48:19,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2022-07-22 12:48:19,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:19,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:19,190 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:19,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2022-07-22 12:48:19,191 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:48:19,191 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:19,357 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:48:19,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:19,360 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:19,360 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:19,360 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:19,360 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:19,360 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:48:19,360 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:19,360 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:19,360 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:19,360 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration15_Loop [2022-07-22 12:48:19,360 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:19,360 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:19,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:19,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:19,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:19,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:19,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:19,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:19,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:19,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:19,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:19,460 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:19,461 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:48:19,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:19,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:19,462 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:19,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2022-07-22 12:48:19,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:19,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:19,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:19,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:19,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:19,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:19,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:19,477 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:19,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2022-07-22 12:48:19,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:19,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:19,500 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:19,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2022-07-22 12:48:19,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:19,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:19,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:19,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:19,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:19,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:19,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:19,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:19,510 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:19,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2022-07-22 12:48:19,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:19,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:19,532 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:19,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2022-07-22 12:48:19,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:19,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:19,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:19,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:19,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:19,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:19,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:19,544 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:19,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2022-07-22 12:48:19,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:19,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:19,567 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:19,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2022-07-22 12:48:19,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:19,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:19,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:19,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:19,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:19,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:19,577 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:19,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:19,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:19,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:19,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:19,603 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:19,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2022-07-22 12:48:19,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:19,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:19,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:19,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:19,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:19,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:19,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:19,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:19,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:19,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2022-07-22 12:48:19,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:19,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:19,637 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:19,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:19,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2022-07-22 12:48:19,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:19,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:19,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:19,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:19,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:19,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:19,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:19,649 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:48:19,653 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:48:19,653 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:48:19,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:19,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:19,654 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:19,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2022-07-22 12:48:19,655 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:48:19,655 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:48:19,655 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:48:19,655 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~i~1#1, ~N2~0) = -1*thread2Thread1of1ForFork0_~i~1#1 + 1*~N2~0 Supporting invariants [] [2022-07-22 12:48:19,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:19,678 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:48:19,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:19,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:19,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:19,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:48:19,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:19,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:19,733 INFO L142 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-22 12:48:19,733 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 150 states and 392 transitions. cyclomatic complexity: 274 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-22 12:48:19,756 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 150 states and 392 transitions. cyclomatic complexity: 274. 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 196 states and 485 transitions. Complement of second has 3 states. [2022-07-22 12:48:19,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:19,761 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-22 12:48:19,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 11 transitions. [2022-07-22 12:48:19,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 10 letters. Loop has 1 letters. [2022-07-22 12:48:19,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:19,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 11 letters. Loop has 1 letters. [2022-07-22 12:48:19,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:19,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 10 letters. Loop has 2 letters. [2022-07-22 12:48:19,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:19,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 485 transitions. [2022-07-22 12:48:19,766 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2022-07-22 12:48:19,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 196 states and 485 transitions. [2022-07-22 12:48:19,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2022-07-22 12:48:19,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2022-07-22 12:48:19,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 485 transitions. [2022-07-22 12:48:19,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:48:19,770 INFO L220 hiAutomatonCegarLoop]: Abstraction has 196 states and 485 transitions. [2022-07-22 12:48:19,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 485 transitions. [2022-07-22 12:48:19,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 143. [2022-07-22 12:48:19,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 143 states have (on average 2.6153846153846154) internal successors, (374), 142 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:19,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 374 transitions. [2022-07-22 12:48:19,776 INFO L242 hiAutomatonCegarLoop]: Abstraction has 143 states and 374 transitions. [2022-07-22 12:48:19,776 INFO L425 stractBuchiCegarLoop]: Abstraction has 143 states and 374 transitions. [2022-07-22 12:48:19,776 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-07-22 12:48:19,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 374 transitions. [2022-07-22 12:48:19,778 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2022-07-22 12:48:19,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:19,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:19,779 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:48:19,779 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:48:19,780 INFO L748 eck$LassoCheckResult]: Stem: 6255#[ULTIMATE.startENTRY]don't care [330] ULTIMATE.startENTRY-->L70-3: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| 0)) (= |v_#NULL.base_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= 2 (select |v_#length_66| 1)) (= |v_#length_65| (store (store |v_#length_66| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4)) (< 0 |v_#StackHeapBarrier_22|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_104|) (= (select |v_#valid_105| 1) 1) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre7#1_35|))) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_main_#t~pre7#1_35| |v_#pthreadsForks_40|) (= 25 (select |v_#length_66| 2)) (= (ite (and (<= 0 v_~N1~0_49) (<= 0 v_~N2~0_45)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_41| 0) (= (select |v_#valid_105| 0) 0) (= (select |v_#valid_105| 2) 1) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_10| 0) (= (select |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= v_~counter~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_44|, #length=|v_#length_66|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, #NULL.offset=|v_#NULL.offset_10|, ~N2~0=v_~N2~0_45, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_24|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_49|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_26|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_35|, #length=|v_#length_65|, ~counter~0=v_~counter~0_80, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_17|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_40|, ~N1~0=v_~N1~0_49, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_22|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ~N2~0, ~N1~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem12#1, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, #valid, #memory_int, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 6257#[L70-3]don't care [249] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, 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|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, 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] 6249#[thread1ENTRY, L70-4]don't care [224] 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] 6251#[L41-4, L70-4]don't care [305] L70-4-->L71-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre9#1_17| |v_#pthreadsForks_20|) (= (select |v_#valid_60| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre9#1_17|)))) InVars {#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_22|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{#pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_11|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_21|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet8#1, #memory_int, ULTIMATE.start_main_#t~pre7#1] 6291#[L71-3, L41-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 6325#[L71-3, L41-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 6357#[L71-3, L41-4]don't care [246] L71-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#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|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, 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, 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] 6359#[thread2ENTRY, L41-4, L71-4]don't care [304] L71-4-->L72-1: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_19|) (select |v_#length_39| |v_ULTIMATE.start_main_~#t1~0#1.base_21|)) (= (select |v_#valid_58| |v_ULTIMATE.start_main_~#t1~0#1.base_21|) 1) (= (select (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t1~0#1.base_21|) |v_ULTIMATE.start_main_~#t1~0#1.offset_19|) |v_ULTIMATE.start_main_#t~mem11#1_14|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_19|)) InVars {#valid=|v_#valid_58|, #memory_int=|v_#memory_int_19|, #length=|v_#length_39|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_19|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_9|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, #valid=|v_#valid_58|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_14|, #memory_int=|v_#memory_int_19|, #length=|v_#length_39|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~mem11#1] 6339#[thread2ENTRY, L41-4, L72-1]don't care [234] 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] 6343#[L41-4, L51-4, L72-1]don't care [313] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_24| 1) |v_thread2Thread1of1ForFork0_~i~1#1_23|) (< |v_thread2Thread1of1ForFork0_~i~1#1_24| v_~N2~0_29) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 v_~counter~0_73) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_73 (+ v_~counter~0_72 1))) InVars {~counter~0=v_~counter~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_24|, ~N2~0=v_~N2~0_29} OutVars{~counter~0=v_~counter~0_72, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N2~0=v_~N2~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_9|} 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] 6489#[L41-4, L51-4, L72-1]don't care [303] L41-4-->thread1EXIT: Formula: (and (not (< v_thread1Thread1of1ForFork1_~i~0_21 v_~N1~0_25)) (= |v_thread1Thread1of1ForFork1_#res.base_9| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_9| 0)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_21, ~N1~0=v_~N1~0_25} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_21, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_9|, ~N1~0=v_~N1~0_25} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] 6363#[L51-4, L72-1, thread1EXIT]don't care [250] thread1EXIT-->L72-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] 6355#[L72-2, L51-4]don't care [2022-07-22 12:48:19,780 INFO L750 eck$LassoCheckResult]: Loop: 6355#[L72-2, L51-4]don't care [313] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_24| 1) |v_thread2Thread1of1ForFork0_~i~1#1_23|) (< |v_thread2Thread1of1ForFork0_~i~1#1_24| v_~N2~0_29) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 v_~counter~0_73) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_73 (+ v_~counter~0_72 1))) InVars {~counter~0=v_~counter~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_24|, ~N2~0=v_~N2~0_29} OutVars{~counter~0=v_~counter~0_72, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N2~0=v_~N2~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_9|} 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] 6355#[L72-2, L51-4]don't care [2022-07-22 12:48:19,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:19,781 INFO L85 PathProgramCache]: Analyzing trace with hash -908830763, now seen corresponding path program 1 times [2022-07-22 12:48:19,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:19,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162103210] [2022-07-22 12:48:19,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:19,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:19,817 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:19,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:19,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:19,860 INFO L85 PathProgramCache]: Analyzing trace with hash 344, now seen corresponding path program 6 times [2022-07-22 12:48:19,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:19,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347077985] [2022-07-22 12:48:19,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:19,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:19,865 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:19,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:19,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:19,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1891017732, now seen corresponding path program 2 times [2022-07-22 12:48:19,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:19,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605633571] [2022-07-22 12:48:19,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:19,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:19,905 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:19,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:19,961 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:19,961 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:19,961 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:19,961 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:19,961 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:48:19,961 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:19,962 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:19,962 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:19,962 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration16_Loop [2022-07-22 12:48:19,962 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:19,962 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:19,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:19,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:19,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:19,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:19,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:19,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:19,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:19,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:19,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:20,040 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:20,040 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:48:20,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:20,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:20,042 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:20,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2022-07-22 12:48:20,044 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:20,045 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:20,067 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:20,067 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_31=0} Honda state: {v_rep#funAddr~thread1.offset_31=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:20,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:20,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:20,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:20,102 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:20,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2022-07-22 12:48:20,104 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:20,104 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:20,131 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:20,132 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_31=-1} Honda state: {v_rep#funAddr~thread2.base_31=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:20,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:20,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:20,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:20,171 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:20,173 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:20,173 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:20,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2022-07-22 12:48:20,195 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:20,195 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_31=-1} Honda state: {v_rep#funAddr~thread1.base_31=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:20,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:20,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:20,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:20,233 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:20,238 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:20,238 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:20,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2022-07-22 12:48:20,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2022-07-22 12:48:20,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:20,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:20,295 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:20,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2022-07-22 12:48:20,297 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:48:20,297 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:20,333 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:48:20,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2022-07-22 12:48:20,335 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:20,335 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:20,335 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:20,335 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:20,335 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:48:20,335 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:20,335 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:20,335 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:20,335 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration16_Loop [2022-07-22 12:48:20,336 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:20,336 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:20,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:20,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:20,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:20,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:20,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:20,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:20,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:20,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:20,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:20,431 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:20,431 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:48:20,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:20,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:20,432 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:20,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2022-07-22 12:48:20,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:20,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:20,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:20,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:20,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:20,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:20,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:20,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:20,442 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:20,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:20,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:20,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:20,466 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:20,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2022-07-22 12:48:20,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:20,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:20,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:20,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:20,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:20,476 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:20,476 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:20,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:20,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2022-07-22 12:48:20,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:20,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:20,501 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:20,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2022-07-22 12:48:20,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:20,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:20,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:20,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:20,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:20,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:20,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:20,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:20,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:20,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:20,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:20,555 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:20,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2022-07-22 12:48:20,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:20,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:20,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:20,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:20,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:20,565 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:20,565 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:20,569 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:20,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2022-07-22 12:48:20,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:20,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:20,593 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:20,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2022-07-22 12:48:20,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:20,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:20,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:20,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:20,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:20,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:20,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:20,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:20,603 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:48:20,606 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:48:20,606 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:48:20,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:20,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:20,607 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:20,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2022-07-22 12:48:20,608 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:48:20,608 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:48:20,608 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:48:20,608 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~counter~0) = 1*~counter~0 Supporting invariants [] [2022-07-22 12:48:20,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:20,631 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:48:20,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:20,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:20,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:20,687 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 12:48:20,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:20,689 INFO L142 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-22 12:48:20,689 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 143 states and 374 transitions. cyclomatic complexity: 261 Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:20,708 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 143 states and 374 transitions. cyclomatic complexity: 261. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 146 states and 379 transitions. Complement of second has 3 states. [2022-07-22 12:48:20,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:20,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:48:20,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 12 letters. Loop has 1 letters. [2022-07-22 12:48:20,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:20,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 13 letters. Loop has 1 letters. [2022-07-22 12:48:20,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:20,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 12 letters. Loop has 2 letters. [2022-07-22 12:48:20,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:20,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 379 transitions. [2022-07-22 12:48:20,719 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-07-22 12:48:20,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 146 states and 379 transitions. [2022-07-22 12:48:20,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2022-07-22 12:48:20,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2022-07-22 12:48:20,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 379 transitions. [2022-07-22 12:48:20,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:48:20,722 INFO L220 hiAutomatonCegarLoop]: Abstraction has 146 states and 379 transitions. [2022-07-22 12:48:20,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 379 transitions. [2022-07-22 12:48:20,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2022-07-22 12:48:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 142 states have (on average 2.619718309859155) internal successors, (372), 141 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 372 transitions. [2022-07-22 12:48:20,727 INFO L242 hiAutomatonCegarLoop]: Abstraction has 142 states and 372 transitions. [2022-07-22 12:48:20,727 INFO L425 stractBuchiCegarLoop]: Abstraction has 142 states and 372 transitions. [2022-07-22 12:48:20,727 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-07-22 12:48:20,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 372 transitions. [2022-07-22 12:48:20,729 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-07-22 12:48:20,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:20,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:20,730 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:48:20,730 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1] [2022-07-22 12:48:20,731 INFO L748 eck$LassoCheckResult]: Stem: 6742#[ULTIMATE.startENTRY]don't care [330] ULTIMATE.startENTRY-->L70-3: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| 0)) (= |v_#NULL.base_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= 2 (select |v_#length_66| 1)) (= |v_#length_65| (store (store |v_#length_66| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4)) (< 0 |v_#StackHeapBarrier_22|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_104|) (= (select |v_#valid_105| 1) 1) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre7#1_35|))) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_main_#t~pre7#1_35| |v_#pthreadsForks_40|) (= 25 (select |v_#length_66| 2)) (= (ite (and (<= 0 v_~N1~0_49) (<= 0 v_~N2~0_45)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_41| 0) (= (select |v_#valid_105| 0) 0) (= (select |v_#valid_105| 2) 1) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_10| 0) (= (select |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= v_~counter~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_44|, #length=|v_#length_66|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, #NULL.offset=|v_#NULL.offset_10|, ~N2~0=v_~N2~0_45, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_24|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_49|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_26|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_35|, #length=|v_#length_65|, ~counter~0=v_~counter~0_80, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_17|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_40|, ~N1~0=v_~N1~0_49, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_22|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ~N2~0, ~N1~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem12#1, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, #valid, #memory_int, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 6744#[L70-3]don't care [249] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, 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|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, 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] 6736#[thread1ENTRY, L70-4]don't care [224] 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] 6738#[L41-4, L70-4]don't care [305] L70-4-->L71-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre9#1_17| |v_#pthreadsForks_20|) (= (select |v_#valid_60| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre9#1_17|)))) InVars {#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_22|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{#pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_11|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_21|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet8#1, #memory_int, ULTIMATE.start_main_#t~pre7#1] 6778#[L71-3, L41-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 6812#[L71-3, L41-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 6836#[L71-3, L41-4]don't care [246] L71-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#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|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, 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, 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] 6838#[thread2ENTRY, L41-4, L71-4]don't care [234] 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] 6852#[L41-4, L51-4, L71-4]don't care [313] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_24| 1) |v_thread2Thread1of1ForFork0_~i~1#1_23|) (< |v_thread2Thread1of1ForFork0_~i~1#1_24| v_~N2~0_29) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 v_~counter~0_73) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_73 (+ v_~counter~0_72 1))) InVars {~counter~0=v_~counter~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_24|, ~N2~0=v_~N2~0_29} OutVars{~counter~0=v_~counter~0_72, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N2~0=v_~N2~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_9|} 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] 6898#[L41-4, L51-4, L71-4]don't care [304] L71-4-->L72-1: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_19|) (select |v_#length_39| |v_ULTIMATE.start_main_~#t1~0#1.base_21|)) (= (select |v_#valid_58| |v_ULTIMATE.start_main_~#t1~0#1.base_21|) 1) (= (select (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t1~0#1.base_21|) |v_ULTIMATE.start_main_~#t1~0#1.offset_19|) |v_ULTIMATE.start_main_#t~mem11#1_14|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_19|)) InVars {#valid=|v_#valid_58|, #memory_int=|v_#memory_int_19|, #length=|v_#length_39|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_19|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_9|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, #valid=|v_#valid_58|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_14|, #memory_int=|v_#memory_int_19|, #length=|v_#length_39|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~mem11#1] 6978#[L41-4, L51-4, L72-1]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 6904#[L41-4, L51-4, L72-1]don't care [313] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_24| 1) |v_thread2Thread1of1ForFork0_~i~1#1_23|) (< |v_thread2Thread1of1ForFork0_~i~1#1_24| v_~N2~0_29) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 v_~counter~0_73) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_73 (+ v_~counter~0_72 1))) InVars {~counter~0=v_~counter~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_24|, ~N2~0=v_~N2~0_29} OutVars{~counter~0=v_~counter~0_72, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N2~0=v_~N2~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_9|} 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] 7008#[L41-4, L51-4, L72-1]don't care [2022-07-22 12:48:20,731 INFO L750 eck$LassoCheckResult]: Loop: 7008#[L41-4, L51-4, L72-1]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 6910#[L41-4, L51-4, L72-1]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 6904#[L41-4, L51-4, L72-1]don't care [313] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_24| 1) |v_thread2Thread1of1ForFork0_~i~1#1_23|) (< |v_thread2Thread1of1ForFork0_~i~1#1_24| v_~N2~0_29) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 v_~counter~0_73) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_73 (+ v_~counter~0_72 1))) InVars {~counter~0=v_~counter~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_24|, ~N2~0=v_~N2~0_29} OutVars{~counter~0=v_~counter~0_72, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N2~0=v_~N2~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_9|} 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] 7008#[L41-4, L51-4, L72-1]don't care [2022-07-22 12:48:20,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:20,732 INFO L85 PathProgramCache]: Analyzing trace with hash -971132206, now seen corresponding path program 4 times [2022-07-22 12:48:20,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:20,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640393208] [2022-07-22 12:48:20,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:20,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:20,748 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:20,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:20,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:20,764 INFO L85 PathProgramCache]: Analyzing trace with hash 334648, now seen corresponding path program 5 times [2022-07-22 12:48:20,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:20,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156257181] [2022-07-22 12:48:20,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:20,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:20,769 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:20,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:20,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:20,775 INFO L85 PathProgramCache]: Analyzing trace with hash -99538233, now seen corresponding path program 5 times [2022-07-22 12:48:20,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:20,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009540388] [2022-07-22 12:48:20,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:20,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:20,796 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:20,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:20,894 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:20,894 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:20,894 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:20,894 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:20,894 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:48:20,894 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:20,894 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:20,894 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:20,894 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration17_Loop [2022-07-22 12:48:20,895 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:20,895 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:20,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:20,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:20,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:20,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:20,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:20,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:20,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:20,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:20,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:20,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:20,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:20,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:21,009 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:21,009 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:48:21,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:21,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:21,012 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:21,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2022-07-22 12:48:21,014 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:21,014 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:21,022 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:21,022 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-22 12:48:21,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:21,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:21,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:21,044 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:21,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2022-07-22 12:48:21,045 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:21,045 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:21,059 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:21,059 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_33=0} Honda state: {v_rep#funAddr~thread1.offset_33=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:21,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2022-07-22 12:48:21,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:21,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:21,081 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:21,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2022-07-22 12:48:21,083 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:21,083 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:21,096 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:21,097 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_33=-1} Honda state: {v_rep#funAddr~thread2.base_33=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:21,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2022-07-22 12:48:21,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:21,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:21,119 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:21,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2022-07-22 12:48:21,120 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:21,120 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:21,135 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:21,135 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_33=-1} Honda state: {v_rep#funAddr~thread1.base_33=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:48:21,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:21,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:21,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:21,158 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:21,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2022-07-22 12:48:21,159 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:21,159 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:21,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:21,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:21,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:21,190 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:21,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2022-07-22 12:48:21,191 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:48:21,191 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:21,466 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:48:21,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:21,469 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:21,469 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:21,469 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:21,469 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:21,469 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:48:21,469 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:21,469 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:21,469 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:21,470 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration17_Loop [2022-07-22 12:48:21,470 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:21,470 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:21,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:21,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:21,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:21,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:21,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:21,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:21,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:21,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:21,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:21,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:21,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:21,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:21,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:21,633 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:21,633 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:48:21,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:21,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:21,634 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:21,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:21,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2022-07-22 12:48:21,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:21,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:21,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:21,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:21,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:21,654 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:21,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:21,667 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:21,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:21,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:21,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:21,703 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:21,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:21,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2022-07-22 12:48:21,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:21,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:21,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:21,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:21,716 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:21,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:21,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:21,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:21,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:21,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:21,741 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:21,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2022-07-22 12:48:21,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:21,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:21,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:21,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:21,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:21,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:21,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:21,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:21,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:21,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:21,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:21,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:21,774 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:21,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2022-07-22 12:48:21,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:21,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:21,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:21,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:21,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:21,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:21,784 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:21,786 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:21,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2022-07-22 12:48:21,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:21,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:21,809 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:21,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2022-07-22 12:48:21,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:21,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:21,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:21,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:21,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:21,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:21,819 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:21,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:21,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:21,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:21,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:21,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:21,858 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:21,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2022-07-22 12:48:21,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:21,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:21,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:21,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:21,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:21,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:21,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:21,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:21,869 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:48:21,872 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:48:21,872 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:48:21,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:21,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:21,873 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:21,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2022-07-22 12:48:21,874 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:48:21,875 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:48:21,875 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:48:21,875 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N1~0, thread1Thread1of1ForFork1_~i~0) = 1*~N1~0 - 1*thread1Thread1of1ForFork1_~i~0 Supporting invariants [] [2022-07-22 12:48:21,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:21,898 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:48:21,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:21,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:21,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:21,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:48:21,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:21,981 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-22 12:48:21,984 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-22 12:48:21,984 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 372 transitions. cyclomatic complexity: 259 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:22,014 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 372 transitions. cyclomatic complexity: 259. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 196 states and 511 transitions. Complement of second has 3 states. [2022-07-22 12:48:22,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:48:22,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 12 letters. Loop has 3 letters. [2022-07-22 12:48:22,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:22,016 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:48:22,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:22,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:22,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:22,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:48:22,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:22,093 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-22 12:48:22,094 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-22 12:48:22,094 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 372 transitions. cyclomatic complexity: 259 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:22,164 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 372 transitions. cyclomatic complexity: 259. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 255 states and 628 transitions. Complement of second has 7 states. [2022-07-22 12:48:22,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-07-22 12:48:22,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 12 letters. Loop has 3 letters. [2022-07-22 12:48:22,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:22,166 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:48:22,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:22,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:22,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:22,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:48:22,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:22,237 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-22 12:48:22,238 INFO L142 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-22 12:48:22,238 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 372 transitions. cyclomatic complexity: 259 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:22,271 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 372 transitions. cyclomatic complexity: 259. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 229 states and 590 transitions. Complement of second has 3 states. [2022-07-22 12:48:22,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:48:22,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2022-07-22 12:48:22,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:22,272 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:48:22,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:22,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:22,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:22,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:48:22,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:22,343 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-22 12:48:22,343 INFO L142 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-22 12:48:22,344 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 372 transitions. cyclomatic complexity: 259 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:22,426 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 372 transitions. cyclomatic complexity: 259. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 597 states and 1525 transitions. Complement of second has 21 states. [2022-07-22 12:48:22,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:22,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:22,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-07-22 12:48:22,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 12 letters. Loop has 3 letters. [2022-07-22 12:48:22,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:22,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 15 letters. Loop has 3 letters. [2022-07-22 12:48:22,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:22,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 12 letters. Loop has 6 letters. [2022-07-22 12:48:22,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:22,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 597 states and 1525 transitions. [2022-07-22 12:48:22,436 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 46 [2022-07-22 12:48:22,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 597 states to 400 states and 971 transitions. [2022-07-22 12:48:22,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2022-07-22 12:48:22,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2022-07-22 12:48:22,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 400 states and 971 transitions. [2022-07-22 12:48:22,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:48:22,441 INFO L220 hiAutomatonCegarLoop]: Abstraction has 400 states and 971 transitions. [2022-07-22 12:48:22,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states and 971 transitions. [2022-07-22 12:48:22,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 188. [2022-07-22 12:48:22,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 188 states have (on average 2.75) internal successors, (517), 187 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:22,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 517 transitions. [2022-07-22 12:48:22,451 INFO L242 hiAutomatonCegarLoop]: Abstraction has 188 states and 517 transitions. [2022-07-22 12:48:22,451 INFO L425 stractBuchiCegarLoop]: Abstraction has 188 states and 517 transitions. [2022-07-22 12:48:22,451 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-07-22 12:48:22,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 517 transitions. [2022-07-22 12:48:22,453 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2022-07-22 12:48:22,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:22,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:22,455 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:48:22,455 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2] [2022-07-22 12:48:22,455 INFO L748 eck$LassoCheckResult]: Stem: 8538#[ULTIMATE.startENTRY]don't care [330] ULTIMATE.startENTRY-->L70-3: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| 0)) (= |v_#NULL.base_10| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= 2 (select |v_#length_66| 1)) (= |v_#length_65| (store (store |v_#length_66| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4)) (< 0 |v_#StackHeapBarrier_22|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_104|) (= (select |v_#valid_105| 1) 1) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre7#1_35|))) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_main_#t~pre7#1_35| |v_#pthreadsForks_40|) (= 25 (select |v_#length_66| 2)) (= (ite (and (<= 0 v_~N1~0_49) (<= 0 v_~N2~0_45)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_41| 0) (= (select |v_#valid_105| 0) 0) (= (select |v_#valid_105| 2) 1) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_10| 0) (= (select |v_#valid_105| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= v_~counter~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_44|, #length=|v_#length_66|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, #NULL.offset=|v_#NULL.offset_10|, ~N2~0=v_~N2~0_45, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_24|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_49|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_26|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_35|, #length=|v_#length_65|, ~counter~0=v_~counter~0_80, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_17|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_40|, ~N1~0=v_~N1~0_49, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_22|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ~N2~0, ~N1~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem12#1, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, #valid, #memory_int, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 8540#[L70-3]don't care [249] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, 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|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, 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] 8532#[thread1ENTRY, L70-4]don't care [224] 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] 8534#[L41-4, L70-4]don't care [305] L70-4-->L71-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_ULTIMATE.start_main_#t~pre9#1_17| |v_#pthreadsForks_20|) (= (select |v_#valid_60| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre9#1_17|)))) InVars {#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_22|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{#pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_11|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_21|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet8#1, #memory_int, ULTIMATE.start_main_#t~pre7#1] 8574#[L71-3, L41-4]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 8612#[L71-3, L41-4]don't care [246] L71-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#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|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, 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, 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] 8636#[thread2ENTRY, L41-4, L71-4]don't care [234] 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] 8652#[L41-4, L51-4, L71-4]don't care [304] L71-4-->L72-1: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_19|) (select |v_#length_39| |v_ULTIMATE.start_main_~#t1~0#1.base_21|)) (= (select |v_#valid_58| |v_ULTIMATE.start_main_~#t1~0#1.base_21|) 1) (= (select (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t1~0#1.base_21|) |v_ULTIMATE.start_main_~#t1~0#1.offset_19|) |v_ULTIMATE.start_main_#t~mem11#1_14|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_19|)) InVars {#valid=|v_#valid_58|, #memory_int=|v_#memory_int_19|, #length=|v_#length_39|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_19|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_9|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, #valid=|v_#valid_58|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_14|, #memory_int=|v_#memory_int_19|, #length=|v_#length_39|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~mem11#1] 8752#[L41-4, L51-4, L72-1]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 8840#[L41-4, L51-4, L72-1]don't care [313] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_24| 1) |v_thread2Thread1of1ForFork0_~i~1#1_23|) (< |v_thread2Thread1of1ForFork0_~i~1#1_24| v_~N2~0_29) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 v_~counter~0_73) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_73 (+ v_~counter~0_72 1))) InVars {~counter~0=v_~counter~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_24|, ~N2~0=v_~N2~0_29} OutVars{~counter~0=v_~counter~0_72, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N2~0=v_~N2~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_9|} 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] 8824#[L41-4, L51-4, L72-1]don't care [2022-07-22 12:48:22,456 INFO L750 eck$LassoCheckResult]: Loop: 8824#[L41-4, L51-4, L72-1]don't care [313] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_24| 1) |v_thread2Thread1of1ForFork0_~i~1#1_23|) (< |v_thread2Thread1of1ForFork0_~i~1#1_24| v_~N2~0_29) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 v_~counter~0_73) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_73 (+ v_~counter~0_72 1))) InVars {~counter~0=v_~counter~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_24|, ~N2~0=v_~N2~0_29} OutVars{~counter~0=v_~counter~0_72, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N2~0=v_~N2~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_9|} 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] 8822#[L41-4, L51-4, L72-1]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 8868#[L41-4, L51-4, L72-1]don't care [307] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_23 (+ v_thread1Thread1of1ForFork1_~i~0_24 1)) (= (+ v_~counter~0_65 1) v_~counter~0_64) (< v_thread1Thread1of1ForFork1_~i~0_24 v_~N1~0_27)) InVars {~counter~0=v_~counter~0_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_24, ~N1~0=v_~N1~0_27} OutVars{~counter~0=v_~counter~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_9|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_23, ~N1~0=v_~N1~0_27} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0] 8666#[L41-4, L51-4, L72-1]don't care [313] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_24| 1) |v_thread2Thread1of1ForFork0_~i~1#1_23|) (< |v_thread2Thread1of1ForFork0_~i~1#1_24| v_~N2~0_29) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 v_~counter~0_73) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_73 (+ v_~counter~0_72 1))) InVars {~counter~0=v_~counter~0_73, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_24|, ~N2~0=v_~N2~0_29} OutVars{~counter~0=v_~counter~0_72, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, ~N2~0=v_~N2~0_29, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_9|} 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] 8824#[L41-4, L51-4, L72-1]don't care [2022-07-22 12:48:22,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:22,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1219645616, now seen corresponding path program 6 times [2022-07-22 12:48:22,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:22,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400630918] [2022-07-22 12:48:22,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:22,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:22,484 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:22,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:22,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:22,512 INFO L85 PathProgramCache]: Analyzing trace with hash 10552961, now seen corresponding path program 6 times [2022-07-22 12:48:22,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:22,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683758000] [2022-07-22 12:48:22,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:22,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:22,523 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:22,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:22,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:22,530 INFO L85 PathProgramCache]: Analyzing trace with hash -271026608, now seen corresponding path program 7 times [2022-07-22 12:48:22,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:22,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730208024] [2022-07-22 12:48:22,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:22,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:22,544 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:22,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:22,671 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:22,672 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:22,672 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:22,672 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:22,672 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:48:22,672 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:22,672 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:22,672 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:22,672 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration18_Loop [2022-07-22 12:48:22,673 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:22,673 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:22,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:22,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:22,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:22,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:22,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:22,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:22,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:22,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:22,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:22,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:22,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:22,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:22,785 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:22,785 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:48:22,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:22,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:22,787 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:22,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2022-07-22 12:48:22,792 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:22,792 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:22,824 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:48:22,824 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-22 12:48:22,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:22,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:22,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:22,856 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:22,862 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:48:22,862 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:22,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2022-07-22 12:48:22,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:22,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:22,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:22,893 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:22,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2022-07-22 12:48:22,894 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:48:22,894 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:48:23,035 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:48:23,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:23,037 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:23,037 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:23,038 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:23,038 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:23,038 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:48:23,038 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:23,038 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:23,038 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:23,038 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration18_Loop [2022-07-22 12:48:23,038 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:23,038 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:23,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:23,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:23,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:23,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:23,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:23,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:23,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:23,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:23,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:23,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:23,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:23,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:23,153 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:23,153 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:48:23,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:23,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:23,154 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:23,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2022-07-22 12:48:23,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:23,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:23,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:23,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:23,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:23,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:23,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:23,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:23,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:23,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2022-07-22 12:48:23,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:23,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:23,192 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:23,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2022-07-22 12:48:23,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:23,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:23,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:23,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:23,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:23,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:23,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:23,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:23,203 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:48:23,206 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:48:23,206 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:48:23,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:23,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:23,208 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:48:23,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2022-07-22 12:48:23,209 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:48:23,209 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:48:23,209 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:48:23,209 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~i~1#1, ~N2~0) = -1*thread2Thread1of1ForFork0_~i~1#1 + 1*~N2~0 Supporting invariants [] [2022-07-22 12:48:23,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:23,232 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:48:23,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:23,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:23,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:23,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:48:23,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:48:23,297 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:48:23,297 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 188 states and 517 transitions. cyclomatic complexity: 356 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:23,327 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 188 states and 517 transitions. cyclomatic complexity: 356. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 221 states and 598 transitions. Complement of second has 3 states. [2022-07-22 12:48:23,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:23,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:23,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:48:23,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 10 letters. Loop has 4 letters. [2022-07-22 12:48:23,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:23,329 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:48:23,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:23,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:23,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:23,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:23,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:48:23,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:48:23,425 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:48:23,425 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 188 states and 517 transitions. cyclomatic complexity: 356 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:23,454 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 188 states and 517 transitions. cyclomatic complexity: 356. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 221 states and 598 transitions. Complement of second has 3 states. [2022-07-22 12:48:23,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:23,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:48:23,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 10 letters. Loop has 4 letters. [2022-07-22 12:48:23,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:23,455 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:48:23,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:23,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:23,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:23,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:23,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:48:23,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:23,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:48:23,514 INFO L142 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:48:23,514 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 188 states and 517 transitions. cyclomatic complexity: 356 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:23,542 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 188 states and 517 transitions. cyclomatic complexity: 356. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 227 states and 606 transitions. Complement of second has 2 states. [2022-07-22 12:48:23,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:23,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:23,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:48:23,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2022-07-22 12:48:23,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:23,544 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:48:23,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:23,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:23,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:23,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:48:23,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:23,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:48:23,598 INFO L142 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:48:23,598 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 188 states and 517 transitions. cyclomatic complexity: 356 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:23,626 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 188 states and 517 transitions. cyclomatic complexity: 356. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 227 states and 606 transitions. Complement of second has 2 states. [2022-07-22 12:48:23,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:48:23,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2022-07-22 12:48:23,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:23,628 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:48:23,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:23,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:23,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:23,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:48:23,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:23,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:48:23,686 INFO L142 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:48:23,687 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 188 states and 517 transitions. cyclomatic complexity: 356 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:23,692 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: determinize is only required for construction of interpolant automaton, not for refinement at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PredicateFactoryRefinement.determinize(PredicateFactoryRefinement.java:104) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PredicateFactoryForInterpolantAutomata.determinize(PredicateFactoryForInterpolantAutomata.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.oldapi.DeterminizedState.getContent(DeterminizedState.java:118) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.PowersetDeterminizer.getState(PowersetDeterminizer.java:180) at de.uni_freiburg.informatik.ultimate.automata.nestedword.buchi.BuchiComplementFKVNwa.constructSinkState(BuchiComplementFKVNwa.java:156) at de.uni_freiburg.informatik.ultimate.automata.nestedword.buchi.BuchiComplementFKVNwa.(BuchiComplementFKVNwa.java:146) at de.uni_freiburg.informatik.ultimate.automata.nestedword.buchi.BuchiDifferenceFKV.constructResult(BuchiDifferenceFKV.java:116) at de.uni_freiburg.informatik.ultimate.automata.nestedword.buchi.BuchiDifferenceFKV.(BuchiDifferenceFKV.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.rankBasedOptimization(RefineBuchi.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.refineBuchi(RefineBuchi.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.BuchiAutomatonCegarLoop.refineBuchi(BuchiAutomatonCegarLoop.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.BuchiAutomatonCegarLoop.refineBuchi(BuchiAutomatonCegarLoop.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.refineBuchiInternal(AbstractBuchiCegarLoop.java:591) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 12:48:23,696 INFO L158 Benchmark]: Toolchain (without parser) took 25037.08ms. Allocated memory was 151.0MB in the beginning and 218.1MB in the end (delta: 67.1MB). Free memory was 126.5MB in the beginning and 154.5MB in the end (delta: -28.0MB). Peak memory consumption was 39.3MB. Max. memory is 8.0GB. [2022-07-22 12:48:23,696 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 151.0MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:48:23,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.42ms. Allocated memory is still 151.0MB. Free memory was 126.3MB in the beginning and 115.6MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 12:48:23,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.47ms. Allocated memory is still 151.0MB. Free memory was 115.5MB in the beginning and 113.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:48:23,697 INFO L158 Benchmark]: Boogie Preprocessor took 29.08ms. Allocated memory is still 151.0MB. Free memory was 113.9MB in the beginning and 112.7MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:48:23,697 INFO L158 Benchmark]: RCFGBuilder took 549.91ms. Allocated memory is still 151.0MB. Free memory was 112.7MB in the beginning and 133.3MB in the end (delta: -20.6MB). Peak memory consumption was 16.9MB. Max. memory is 8.0GB. [2022-07-22 12:48:23,698 INFO L158 Benchmark]: BuchiAutomizer took 24103.77ms. Allocated memory was 151.0MB in the beginning and 218.1MB in the end (delta: 67.1MB). Free memory was 132.8MB in the beginning and 154.5MB in the end (delta: -21.7MB). Peak memory consumption was 45.4MB. Max. memory is 8.0GB. [2022-07-22 12:48:23,700 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.22ms. Allocated memory is still 151.0MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 298.42ms. Allocated memory is still 151.0MB. Free memory was 126.3MB in the beginning and 115.6MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.47ms. Allocated memory is still 151.0MB. Free memory was 115.5MB in the beginning and 113.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.08ms. Allocated memory is still 151.0MB. Free memory was 113.9MB in the beginning and 112.7MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 549.91ms. Allocated memory is still 151.0MB. Free memory was 112.7MB in the beginning and 133.3MB in the end (delta: -20.6MB). Peak memory consumption was 16.9MB. Max. memory is 8.0GB. * BuchiAutomizer took 24103.77ms. Allocated memory was 151.0MB in the beginning and 218.1MB in the end (delta: 67.1MB). Free memory was 132.8MB in the beginning and 154.5MB in the end (delta: -21.7MB). Peak memory consumption was 45.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 85 PlacesBefore, 20 PlacesAfterwards, 84 TransitionsBefore, 15 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 6 FixpointIterations, 47 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 82 TotalNumberOfCompositions, 527 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 501, positive: 497, positive conditional: 0, positive unconditional: 497, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 267, positive: 264, positive conditional: 0, positive unconditional: 264, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 501, positive: 233, positive conditional: 0, positive unconditional: 233, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 267, unknown conditional: 0, unknown unconditional: 267] , 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 - ExceptionOrErrorResult: AssertionError: determinize is only required for construction of interpolant automaton, not for refinement de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: determinize is only required for construction of interpolant automaton, not for refinement: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PredicateFactoryRefinement.determinize(PredicateFactoryRefinement.java:104) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 12:48:23,746 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...