/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/test-easy11.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:51:51,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:51:51,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:51:51,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:51:51,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:51:51,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:51:51,992 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:51:51,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:51:52,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:51:52,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:51:52,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:51:52,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:51:52,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:51:52,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:51:52,030 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:51:52,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:51:52,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:51:52,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:51:52,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:51:52,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:51:52,053 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:51:52,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:51:52,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:51:52,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:51:52,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:51:52,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:51:52,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:51:52,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:51:52,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:51:52,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:51:52,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:51:52,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:51:52,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:51:52,079 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:51:52,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:51:52,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:51:52,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:51:52,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:51:52,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:51:52,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:51:52,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:51:52,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:51:52,094 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:51:52,146 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:51:52,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:51:52,147 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:51:52,147 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:51:52,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:51:52,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:51:52,149 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:51:52,150 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:51:52,150 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:51:52,151 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:51:52,151 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:51:52,152 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:51:52,152 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:51:52,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:51:52,152 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:51:52,153 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:51:52,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:51:52,153 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:51:52,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:51:52,153 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:51:52,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:51:52,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:51:52,154 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:51:52,154 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:51:52,154 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:51:52,155 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:51:52,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:51:52,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:51:52,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:51:52,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:51:52,156 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:51:52,157 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:51:52,160 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:51:52,160 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:51:52,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:51:52,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:51:52,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:51:52,596 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:51:52,600 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:51:52,602 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy11.wvr.c [2022-07-22 12:51:52,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6f72a0fd/7514ee5021f74abe87e914fb9aa18700/FLAG9c6080d02 [2022-07-22 12:51:53,351 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:51:53,352 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy11.wvr.c [2022-07-22 12:51:53,361 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6f72a0fd/7514ee5021f74abe87e914fb9aa18700/FLAG9c6080d02 [2022-07-22 12:51:53,722 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6f72a0fd/7514ee5021f74abe87e914fb9aa18700 [2022-07-22 12:51:53,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:51:53,733 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:51:53,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:51:53,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:51:53,744 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:51:53,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:51:53" (1/1) ... [2022-07-22 12:51:53,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2089aff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:51:53, skipping insertion in model container [2022-07-22 12:51:53,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:51:53" (1/1) ... [2022-07-22 12:51:53,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:51:53,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:51:54,089 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/test-easy11.wvr.c[2005,2018] [2022-07-22 12:51:54,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:51:54,099 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:51:54,122 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/test-easy11.wvr.c[2005,2018] [2022-07-22 12:51:54,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:51:54,141 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:51:54,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:51:54 WrapperNode [2022-07-22 12:51:54,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:51:54,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:51:54,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:51:54,143 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:51:54,151 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:51:54" (1/1) ... [2022-07-22 12:51:54,160 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:51:54" (1/1) ... [2022-07-22 12:51:54,182 INFO L137 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 52 [2022-07-22 12:51:54,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:51:54,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:51:54,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:51:54,184 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:51:54,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:51:54" (1/1) ... [2022-07-22 12:51:54,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:51:54" (1/1) ... [2022-07-22 12:51:54,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:51:54" (1/1) ... [2022-07-22 12:51:54,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:51:54" (1/1) ... [2022-07-22 12:51:54,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:51:54" (1/1) ... [2022-07-22 12:51:54,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:51:54" (1/1) ... [2022-07-22 12:51:54,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:51:54" (1/1) ... [2022-07-22 12:51:54,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:51:54,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:51:54,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:51:54,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:51:54,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:51:54" (1/1) ... [2022-07-22 12:51:54,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:51:54,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:51:54,258 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:51:54,281 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:51:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:51:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:51:54,326 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:51:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:51:54,326 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:51:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:51:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:51:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:51:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:51:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:51:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:51:54,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:51:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:51:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:51:54,330 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:51:54,406 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:51:54,408 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:51:54,647 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:51:54,659 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:51:54,659 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 12:51:54,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:51:54 BoogieIcfgContainer [2022-07-22 12:51:54,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:51:54,666 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:51:54,666 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:51:54,672 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:51:54,673 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:51:54,673 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:51:53" (1/3) ... [2022-07-22 12:51:54,674 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@174a1f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:51:54, skipping insertion in model container [2022-07-22 12:51:54,675 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:51:54,675 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:51:54" (2/3) ... [2022-07-22 12:51:54,676 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@174a1f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:51:54, skipping insertion in model container [2022-07-22 12:51:54,676 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:51:54,676 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:51:54" (3/3) ... [2022-07-22 12:51:54,678 INFO L322 chiAutomizerObserver]: Analyzing ICFG test-easy11.wvr.c [2022-07-22 12:51:54,934 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:51:54,975 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 87 transitions, 190 flow [2022-07-22 12:51:55,030 INFO L129 PetriNetUnfolder]: 6/83 cut-off events. [2022-07-22 12:51:55,033 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:51:55,041 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 83 events. 6/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2022-07-22 12:51:55,041 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 87 transitions, 190 flow [2022-07-22 12:51:55,058 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 83 transitions, 178 flow [2022-07-22 12:51:55,063 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:51:55,076 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 83 transitions, 178 flow [2022-07-22 12:51:55,085 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 83 transitions, 178 flow [2022-07-22 12:51:55,086 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 83 transitions, 178 flow [2022-07-22 12:51:55,131 INFO L129 PetriNetUnfolder]: 6/83 cut-off events. [2022-07-22 12:51:55,132 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:51:55,133 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 83 events. 6/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2022-07-22 12:51:55,135 INFO L116 LiptonReduction]: Number of co-enabled transitions 572 [2022-07-22 12:51:57,759 INFO L131 LiptonReduction]: Checked pairs total: 537 [2022-07-22 12:51:57,760 INFO L133 LiptonReduction]: Total number of compositions: 82 [2022-07-22 12:51:57,781 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:51:57,781 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:51:57,782 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:51:57,782 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:51:57,782 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:51:57,782 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:51:57,782 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:51:57,782 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:51:57,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:51:57,823 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:51:57,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:51:57,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:51:57,831 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:51:57,831 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:51:57,831 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:51:57,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 33 states, but on-demand construction may add more states [2022-07-22 12:51:57,836 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:51:57,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:51:57,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:51:57,837 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:51:57,837 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:51:57,843 INFO L748 eck$LassoCheckResult]: Stem: 89#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (= v_~Y~0_53 0) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_53, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 92#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 94#[thread1ENTRY, L73-4]don't care [246] thread1ENTRY-->L43-2: Formula: (= v_~X~0_12 v_thread1Thread1of1ForFork1_~x~0_21) InVars {~X~0=v_~X~0_12} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_21, ~X~0=v_~X~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0] 96#[L43-2, L73-4]don't care [2022-07-22 12:51:57,843 INFO L750 eck$LassoCheckResult]: Loop: 96#[L43-2, L73-4]don't care [283] L43-2-->L43-2: Formula: (and (= v_thread1Thread1of1ForFork1_~x~0_35 (+ v_thread1Thread1of1ForFork1_~x~0_36 1)) (< v_thread1Thread1of1ForFork1_~x~0_36 10000)) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_36} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_35} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 96#[L43-2, L73-4]don't care [2022-07-22 12:51:57,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:51:57,850 INFO L85 PathProgramCache]: Analyzing trace with hash 329993, now seen corresponding path program 1 times [2022-07-22 12:51:57,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:51:57,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69313580] [2022-07-22 12:51:57,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:51:57,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:51:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:51:57,994 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:51:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:51:58,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:51:58,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:51:58,044 INFO L85 PathProgramCache]: Analyzing trace with hash 314, now seen corresponding path program 1 times [2022-07-22 12:51:58,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:51:58,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778478849] [2022-07-22 12:51:58,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:51:58,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:51:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:51:58,052 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:51:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:51:58,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:51:58,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:51:58,060 INFO L85 PathProgramCache]: Analyzing trace with hash 10230066, now seen corresponding path program 1 times [2022-07-22 12:51:58,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:51:58,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170162820] [2022-07-22 12:51:58,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:51:58,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:51:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:51:58,098 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:51:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:51:58,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:51:58,188 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:51:58,188 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:51:58,189 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:51:58,189 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:51:58,189 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:51:58,189 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:51:58,189 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:51:58,189 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:51:58,190 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration1_Loop [2022-07-22 12:51:58,190 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:51:58,190 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:51:58,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:51:58,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:51:58,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:51:58,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:51:58,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:51:58,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:51:58,283 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:51:58,284 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:51:58,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:51:58,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:51:58,289 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:51:58,298 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:51:58,299 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:51:58,300 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:51:58,328 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:51:58,329 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:51:58,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 12:51:58,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:51:58,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:51:58,416 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:51:58,424 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:51:58,424 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:51:58,439 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:51:58,449 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:51:58,449 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:51:58,498 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:51:58,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:51:58,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:51:58,500 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:51:58,506 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:51:58,506 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:51:58,520 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:51:58,535 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:51:58,535 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_1=-1} Honda state: {v_rep#funAddr~thread1.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:51:58,580 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:51:58,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:51:58,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:51:58,582 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:51:58,589 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:51:58,590 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:51:58,605 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:51:58,610 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:51:58,610 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_1=0} Honda state: {v_rep#funAddr~thread1.offset_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:51:58,641 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:51:58,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:51:58,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:51:58,643 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:51:58,664 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:51:58,665 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:51:58,668 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:51:58,700 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:51:58,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:51:58,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:51:58,702 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:51:58,703 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:51:58,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:51:58,706 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:51:58,764 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:51:58,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-22 12:51:58,770 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:51:58,770 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:51:58,771 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:51:58,771 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:51:58,771 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:51:58,771 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:51:58,771 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:51:58,771 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:51:58,772 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration1_Loop [2022-07-22 12:51:58,772 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:51:58,772 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:51:58,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:51:58,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:51:58,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:51:58,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:51:58,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:51:58,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:51:58,842 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:51:58,847 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:51:58,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:51:58,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:51:58,851 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:51:58,857 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:51:58,862 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:51:58,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:51:58,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:51:58,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:51:58,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:51:58,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:51:58,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:51:58,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:51:58,884 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:51:58,917 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:51:58,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:51:58,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:51:58,919 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:51:58,927 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:51:58,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:51:58,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:51:58,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:51:58,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:51:58,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:51:58,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:51:58,944 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:51:58,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:51:58,977 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:51:58,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:51:58,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:51:58,979 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:51:58,981 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:51:58,981 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:51:58,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:51:58,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:51:58,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:51:58,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:51:58,993 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:51:58,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:51:58,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:51:59,021 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:51:59,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:51:59,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:51:59,023 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:51:59,024 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:51:59,030 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:51:59,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:51:59,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:51:59,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:51:59,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:51:59,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:51:59,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:51:59,046 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:51:59,069 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:51:59,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:51:59,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:51:59,072 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:51:59,074 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:51:59,075 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:51:59,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:51:59,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:51:59,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:51:59,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:51:59,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:51:59,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:51:59,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:51:59,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 12:51:59,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:51:59,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:51:59,141 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:51:59,144 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:51:59,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:51:59,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:51:59,155 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:51:59,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:51:59,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:51:59,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:51:59,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:51:59,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:51:59,161 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:51:59,166 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:51:59,167 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:51:59,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:51:59,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:51:59,171 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:51:59,173 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:51:59,173 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:51:59,173 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:51:59,174 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:51:59,174 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~x~0) = -2*thread1Thread1of1ForFork1_~x~0 + 19999 Supporting invariants [] [2022-07-22 12:51:59,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 12:51:59,200 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:51:59,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:51:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:51:59,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:51:59,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:51:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:51:59,273 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:51:59,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:51:59,274 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:51:59,311 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:51:59,314 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:51:59,387 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:51:59,389 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:51:59,395 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:51:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 10 transitions. [2022-07-22 12:51:59,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 3 letters. Loop has 1 letters. [2022-07-22 12:51:59,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:51:59,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 4 letters. Loop has 1 letters. [2022-07-22 12:51:59,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:51:59,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 3 letters. Loop has 2 letters. [2022-07-22 12:51:59,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:51:59,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 161 transitions. [2022-07-22 12:51:59,408 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2022-07-22 12:51:59,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 52 states and 135 transitions. [2022-07-22 12:51:59,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-22 12:51:59,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-07-22 12:51:59,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 135 transitions. [2022-07-22 12:51:59,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:51:59,420 INFO L220 hiAutomatonCegarLoop]: Abstraction has 52 states and 135 transitions. [2022-07-22 12:51:59,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 135 transitions. [2022-07-22 12:51:59,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2022-07-22 12:51:59,455 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:51:59,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 104 transitions. [2022-07-22 12:51:59,458 INFO L242 hiAutomatonCegarLoop]: Abstraction has 40 states and 104 transitions. [2022-07-22 12:51:59,458 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 104 transitions. [2022-07-22 12:51:59,458 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:51:59,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 104 transitions. [2022-07-22 12:51:59,461 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2022-07-22 12:51:59,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:51:59,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:51:59,462 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:51:59,462 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:51:59,463 INFO L748 eck$LassoCheckResult]: Stem: 309#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (= v_~Y~0_53 0) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_53, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 311#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 321#[thread1ENTRY, L73-4]don't care [246] thread1ENTRY-->L43-2: Formula: (= v_~X~0_12 v_thread1Thread1of1ForFork1_~x~0_21) InVars {~X~0=v_~X~0_12} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_21, ~X~0=v_~X~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0] 281#[L43-2, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 287#[L43-2, L74-3]don't care [2022-07-22 12:51:59,463 INFO L750 eck$LassoCheckResult]: Loop: 287#[L43-2, L74-3]don't care [283] L43-2-->L43-2: Formula: (and (= v_thread1Thread1of1ForFork1_~x~0_35 (+ v_thread1Thread1of1ForFork1_~x~0_36 1)) (< v_thread1Thread1of1ForFork1_~x~0_36 10000)) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_36} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_35} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 287#[L43-2, L74-3]don't care [2022-07-22 12:51:59,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:51:59,464 INFO L85 PathProgramCache]: Analyzing trace with hash 10230069, now seen corresponding path program 1 times [2022-07-22 12:51:59,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:51:59,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882981874] [2022-07-22 12:51:59,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:51:59,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:51:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:51:59,487 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:51:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:51:59,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:51:59,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:51:59,512 INFO L85 PathProgramCache]: Analyzing trace with hash 314, now seen corresponding path program 2 times [2022-07-22 12:51:59,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:51:59,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494765251] [2022-07-22 12:51:59,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:51:59,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:51:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:51:59,517 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:51:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:51:59,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:51:59,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:51:59,522 INFO L85 PathProgramCache]: Analyzing trace with hash 317132422, now seen corresponding path program 1 times [2022-07-22 12:51:59,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:51:59,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107547605] [2022-07-22 12:51:59,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:51:59,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:51:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:51:59,566 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:51:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:51:59,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:51:59,628 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:51:59,628 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:51:59,629 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:51:59,629 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:51:59,629 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:51:59,629 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:51:59,629 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:51:59,629 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:51:59,629 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration2_Loop [2022-07-22 12:51:59,629 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:51:59,630 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:51:59,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:51:59,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:51:59,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:51:59,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:51:59,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:51:59,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:51:59,704 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:51:59,705 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:51:59,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:51:59,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:51:59,706 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:51:59,723 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:51:59,723 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:51:59,743 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:51:59,751 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:51:59,752 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:51:59,796 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:51:59,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:51:59,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:51:59,799 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:51:59,808 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:51:59,808 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:51:59,822 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:51:59,831 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:51:59,831 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:51:59,879 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:51:59,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:51:59,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:51:59,881 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:51:59,887 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:51:59,887 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:51:59,901 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:51:59,908 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:51:59,909 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:51:59,950 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:51:59,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:51:59,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:51:59,952 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:51:59,956 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:51:59,956 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:51:59,957 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:51:59,982 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:51:59,982 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:52:00,023 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:52:00,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:00,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:00,025 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:52:00,031 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:00,031 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:00,043 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:52:00,075 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:52:00,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:00,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:00,076 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:52:00,082 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:52:00,082 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:00,082 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:52:00,150 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:52:00,156 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:52:00,157 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:00,157 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:00,157 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:00,157 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:00,157 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:52:00,157 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:00,157 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:00,157 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:00,157 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration2_Loop [2022-07-22 12:52:00,158 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:00,158 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:00,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:00,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:00,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:00,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:00,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:00,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:52:00,213 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:00,213 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:52:00,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:00,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:00,215 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:52:00,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:52:00,224 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:52:00,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:00,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:00,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:00,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:00,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:00,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:00,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:00,234 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:00,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-07-22 12:52:00,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:00,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:00,263 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:52:00,264 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:52:00,265 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:52:00,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:00,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:00,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:00,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:00,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:00,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:00,298 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:00,336 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:52:00,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:00,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:00,340 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:52:00,343 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:52:00,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:00,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:00,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:00,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:00,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:00,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:00,359 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:52:00,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:00,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-22 12:52:00,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:00,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:00,404 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:52:00,405 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:52:00,406 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:52:00,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:00,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:00,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:00,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:00,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:00,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:00,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:00,417 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:52:00,419 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:52:00,420 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:52:00,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:00,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:00,421 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:52:00,422 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:52:00,422 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:52:00,423 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:52:00,423 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:52:00,423 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~x~0) = -2*thread1Thread1of1ForFork1_~x~0 + 19999 Supporting invariants [] [2022-07-22 12:52:00,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-22 12:52:00,448 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:52:00,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:00,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:52:00,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:00,499 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:52:00,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:00,500 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:52:00,501 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:52:00,501 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:52:00,527 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:52:00,528 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:52:00,529 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:52:00,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 7 transitions. [2022-07-22 12:52:00,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 4 letters. Loop has 1 letters. [2022-07-22 12:52:00,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:00,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:52:00,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:00,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-22 12:52:00,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:00,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 115 transitions. [2022-07-22 12:52:00,533 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2022-07-22 12:52:00,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 115 transitions. [2022-07-22 12:52:00,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-22 12:52:00,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2022-07-22 12:52:00,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 115 transitions. [2022-07-22 12:52:00,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:52:00,536 INFO L220 hiAutomatonCegarLoop]: Abstraction has 45 states and 115 transitions. [2022-07-22 12:52:00,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 115 transitions. [2022-07-22 12:52:00,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2022-07-22 12:52:00,541 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:52:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 101 transitions. [2022-07-22 12:52:00,542 INFO L242 hiAutomatonCegarLoop]: Abstraction has 39 states and 101 transitions. [2022-07-22 12:52:00,542 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 101 transitions. [2022-07-22 12:52:00,543 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:52:00,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 101 transitions. [2022-07-22 12:52:00,545 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2022-07-22 12:52:00,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:52:00,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:52:00,546 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:52:00,546 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:52:00,546 INFO L748 eck$LassoCheckResult]: Stem: 463#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (= v_~Y~0_53 0) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_53, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 465#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 475#[thread1ENTRY, L73-4]don't care [246] thread1ENTRY-->L43-2: Formula: (= v_~X~0_12 v_thread1Thread1of1ForFork1_~x~0_21) InVars {~X~0=v_~X~0_12} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_21, ~X~0=v_~X~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0] 437#[L43-2, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 443#[L43-2, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 427#[thread2ENTRY, L43-2, L74-4]don't care [2022-07-22 12:52:00,547 INFO L750 eck$LassoCheckResult]: Loop: 427#[thread2ENTRY, L43-2, L74-4]don't care [283] L43-2-->L43-2: Formula: (and (= v_thread1Thread1of1ForFork1_~x~0_35 (+ v_thread1Thread1of1ForFork1_~x~0_36 1)) (< v_thread1Thread1of1ForFork1_~x~0_36 10000)) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_36} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_35} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 427#[thread2ENTRY, L43-2, L74-4]don't care [2022-07-22 12:52:00,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:00,547 INFO L85 PathProgramCache]: Analyzing trace with hash 317132357, now seen corresponding path program 1 times [2022-07-22 12:52:00,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:00,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570139376] [2022-07-22 12:52:00,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:00,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:00,571 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:00,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:00,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:00,594 INFO L85 PathProgramCache]: Analyzing trace with hash 314, now seen corresponding path program 3 times [2022-07-22 12:52:00,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:00,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168250011] [2022-07-22 12:52:00,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:00,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:00,600 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:00,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:00,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:00,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1241168758, now seen corresponding path program 1 times [2022-07-22 12:52:00,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:00,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884403123] [2022-07-22 12:52:00,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:00,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:00,627 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:00,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:00,662 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:00,662 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:00,662 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:00,662 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:00,662 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:52:00,662 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:00,662 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:00,663 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:00,663 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration3_Loop [2022-07-22 12:52:00,663 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:00,663 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:00,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:00,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:00,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:00,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:00,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:00,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:00,722 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:00,722 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:52:00,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:00,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:00,725 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:52:00,734 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:00,734 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:00,749 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:52:00,756 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:00,757 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:52:00,803 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:52:00,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:00,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:00,805 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:52:00,807 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:00,807 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:00,822 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:52:00,829 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:00,830 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:52:00,879 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:52:00,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:00,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:00,881 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:52:00,885 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:00,885 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:00,887 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:52:00,911 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:00,912 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:52:00,951 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:52:00,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:00,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:00,953 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:52:00,955 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:00,955 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:00,965 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:52:01,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:01,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:01,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:01,021 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:52:01,024 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:52:01,025 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:01,040 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:52:01,100 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:52:01,106 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:52:01,107 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:01,107 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:01,107 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:01,107 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:01,107 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:52:01,107 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:01,108 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:01,108 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:01,108 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration3_Loop [2022-07-22 12:52:01,108 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:01,108 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:01,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:52:01,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:52:01,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:52:01,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:01,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:01,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:01,169 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:01,169 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:52:01,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:01,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:01,171 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:52:01,175 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:52:01,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:01,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:01,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:01,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:01,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:01,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:01,190 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:52:01,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:01,242 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:52:01,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:01,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:01,244 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:52:01,246 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:52:01,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:01,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:01,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:01,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:01,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:01,258 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:01,262 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:52:01,270 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:01,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:01,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:01,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:01,311 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:52:01,313 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:52:01,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:01,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:01,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:01,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:01,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:01,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:01,331 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:52:01,342 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:01,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-22 12:52:01,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:01,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:01,374 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:52:01,375 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:52:01,376 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:52:01,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:01,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:01,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:01,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:01,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:01,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:01,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:01,415 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:52:01,418 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:52:01,418 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:52:01,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:01,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:01,438 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:52:01,444 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:52:01,444 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:52:01,444 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:52:01,444 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~x~0) = -2*thread1Thread1of1ForFork1_~x~0 + 19999 Supporting invariants [] [2022-07-22 12:52:01,445 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:52:01,463 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:52:01,514 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:52:01,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:01,515 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:52:01,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:01,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:52:01,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:01,556 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:52:01,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:01,557 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:52:01,558 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:52:01,558 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:52:01,583 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:52:01,584 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:52:01,585 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:52:01,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2022-07-22 12:52:01,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:52:01,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:01,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:52:01,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:01,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 12:52:01,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:01,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 125 transitions. [2022-07-22 12:52:01,589 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2022-07-22 12:52:01,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 125 transitions. [2022-07-22 12:52:01,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2022-07-22 12:52:01,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-07-22 12:52:01,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 125 transitions. [2022-07-22 12:52:01,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:52:01,592 INFO L220 hiAutomatonCegarLoop]: Abstraction has 47 states and 125 transitions. [2022-07-22 12:52:01,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 125 transitions. [2022-07-22 12:52:01,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2022-07-22 12:52:01,597 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:52:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 97 transitions. [2022-07-22 12:52:01,598 INFO L242 hiAutomatonCegarLoop]: Abstraction has 38 states and 97 transitions. [2022-07-22 12:52:01,598 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 97 transitions. [2022-07-22 12:52:01,598 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:52:01,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 97 transitions. [2022-07-22 12:52:01,600 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2022-07-22 12:52:01,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:52:01,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:52:01,600 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:52:01,600 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:52:01,601 INFO L748 eck$LassoCheckResult]: Stem: 622#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (= v_~Y~0_53 0) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_53, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 624#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 634#[thread1ENTRY, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 606#[thread1ENTRY, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 610#[thread1ENTRY, thread2ENTRY, L74-4]don't care [224] thread2ENTRY-->L56-2: Formula: (= v_thread2Thread1of1ForFork0_~x~1_17 v_~X~0_6) InVars {~X~0=v_~X~0_6} OutVars{~X~0=v_~X~0_6, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_17} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1] 636#[thread1ENTRY, L74-4, L56-2]don't care [2022-07-22 12:52:01,601 INFO L750 eck$LassoCheckResult]: Loop: 636#[thread1ENTRY, L74-4, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_36 1) v_thread2Thread1of1ForFork0_~x~1_35) (< v_thread2Thread1of1ForFork0_~x~1_36 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_36} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_35, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 636#[thread1ENTRY, L74-4, L56-2]don't care [2022-07-22 12:52:01,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:01,602 INFO L85 PathProgramCache]: Analyzing trace with hash 317168695, now seen corresponding path program 1 times [2022-07-22 12:52:01,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:01,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035589742] [2022-07-22 12:52:01,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:01,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:01,620 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:01,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:01,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:01,638 INFO L85 PathProgramCache]: Analyzing trace with hash 313, now seen corresponding path program 1 times [2022-07-22 12:52:01,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:01,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309343129] [2022-07-22 12:52:01,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:01,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:01,647 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:01,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:01,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:01,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1242295235, now seen corresponding path program 1 times [2022-07-22 12:52:01,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:01,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520072998] [2022-07-22 12:52:01,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:01,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:01,687 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:01,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:01,741 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:01,741 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:01,741 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:01,741 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:01,741 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:52:01,742 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:01,742 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:01,742 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:01,742 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration4_Loop [2022-07-22 12:52:01,742 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:01,742 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:01,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:01,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:01,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:01,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:01,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:52:01,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:52:01,799 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:01,799 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:52:01,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:01,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:01,800 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:52:01,809 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:01,809 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:01,823 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:52:01,828 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:01,828 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_7=-1} Honda state: {v_rep#funAddr~thread2.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:52:01,867 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:52:01,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:01,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:01,869 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:52:01,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:01,871 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:01,886 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:52:01,892 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:01,892 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_7=-1} Honda state: {v_rep#funAddr~thread1.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:52:01,920 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:52:01,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:01,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:01,921 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:52:01,922 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:52:01,923 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:01,923 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:01,937 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:01,937 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_#t~post2=0} Honda state: {thread2Thread1of1ForFork0_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:52:01,959 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:52:01,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:01,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:01,960 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:52:01,961 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:52:01,963 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:01,963 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:01,976 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:01,976 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_7=0} Honda state: {v_rep#funAddr~thread1.offset_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:52:02,005 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:52:02,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:02,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:02,006 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:52:02,010 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:52:02,011 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:02,011 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:02,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-22 12:52:02,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:02,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:02,058 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:52:02,059 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:52:02,061 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:52:02,061 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:02,102 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:52:02,104 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:52:02,104 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:02,105 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:02,105 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:02,105 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:02,105 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:52:02,105 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:02,105 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:02,105 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:02,105 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration4_Loop [2022-07-22 12:52:02,105 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:02,105 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:02,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:52:02,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:52:02,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:02,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:02,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:02,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:02,167 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:02,167 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:52:02,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:02,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:02,169 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:52:02,183 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:52:02,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:02,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:02,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:02,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:02,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:02,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:02,198 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:52:02,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:02,243 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:52:02,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:02,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:02,245 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:52:02,247 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:52:02,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:02,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:02,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:02,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:02,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:02,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:02,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:02,258 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:52:02,266 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:02,288 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:52:02,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:02,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:02,290 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:52:02,290 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:52:02,292 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:52:02,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:02,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:02,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:02,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:02,301 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:02,301 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:02,321 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:02,357 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:52:02,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:02,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:02,358 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:52:02,359 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:52:02,360 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:52:02,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:02,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:02,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:02,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:02,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:02,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:02,384 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:02,420 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:52:02,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:02,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:02,423 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:52:02,430 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:52:02,430 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:52:02,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:02,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:02,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:02,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:02,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:02,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:02,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:02,441 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:52:02,443 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:52:02,443 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:52:02,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:02,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:02,444 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:52:02,445 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:52:02,445 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:52:02,445 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:52:02,445 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:52:02,445 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~x~1) = -2*thread2Thread1of1ForFork0_~x~1 + 19999 Supporting invariants [] [2022-07-22 12:52:02,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-07-22 12:52:02,470 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:52:02,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:02,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:52:02,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:02,516 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:52:02,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:02,516 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:52:02,517 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:52:02,517 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:52:02,555 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:52:02,556 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:52:02,557 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:52:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:52:02,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:52:02,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:02,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:52:02,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:02,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 12:52:02,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:02,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 162 transitions. [2022-07-22 12:52:02,560 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 10 [2022-07-22 12:52:02,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 60 states and 158 transitions. [2022-07-22 12:52:02,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2022-07-22 12:52:02,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2022-07-22 12:52:02,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 158 transitions. [2022-07-22 12:52:02,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:52:02,563 INFO L220 hiAutomatonCegarLoop]: Abstraction has 60 states and 158 transitions. [2022-07-22 12:52:02,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 158 transitions. [2022-07-22 12:52:02,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2022-07-22 12:52:02,568 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:52:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 128 transitions. [2022-07-22 12:52:02,569 INFO L242 hiAutomatonCegarLoop]: Abstraction has 49 states and 128 transitions. [2022-07-22 12:52:02,569 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 128 transitions. [2022-07-22 12:52:02,569 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:52:02,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 128 transitions. [2022-07-22 12:52:02,571 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 10 [2022-07-22 12:52:02,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:52:02,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:52:02,571 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:52:02,571 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:52:02,572 INFO L748 eck$LassoCheckResult]: Stem: 797#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (= v_~Y~0_53 0) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_53, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 799#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 821#[thread1ENTRY, L73-4]don't care [246] thread1ENTRY-->L43-2: Formula: (= v_~X~0_12 v_thread1Thread1of1ForFork1_~x~0_21) InVars {~X~0=v_~X~0_12} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_21, ~X~0=v_~X~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0] 773#[L43-2, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 779#[L43-2, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 761#[thread2ENTRY, L43-2, L74-4]don't care [276] L74-4-->L75-1: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (select |v_#length_37| |v_ULTIMATE.start_main_~#t1~0#1.base_25|)) (= (select |v_#valid_62| |v_ULTIMATE.start_main_~#t1~0#1.base_25|) 1) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (= |v_ULTIMATE.start_main_#t~mem8#1_14| (select (select |v_#memory_int_31| |v_ULTIMATE.start_main_~#t1~0#1.base_25|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21|))) InVars {#valid=|v_#valid_62|, #memory_int=|v_#memory_int_31|, #length=|v_#length_37|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_17|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_14|, #valid=|v_#valid_62|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_9|, #memory_int=|v_#memory_int_31|, #length=|v_#length_37|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~nondet7#1] 765#[thread2ENTRY, L75-1, L43-2]don't care [2022-07-22 12:52:02,572 INFO L750 eck$LassoCheckResult]: Loop: 765#[thread2ENTRY, L75-1, L43-2]don't care [283] L43-2-->L43-2: Formula: (and (= v_thread1Thread1of1ForFork1_~x~0_35 (+ v_thread1Thread1of1ForFork1_~x~0_36 1)) (< v_thread1Thread1of1ForFork1_~x~0_36 10000)) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_36} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_35} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 765#[thread2ENTRY, L75-1, L43-2]don't care [2022-07-22 12:52:02,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:02,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1241168751, now seen corresponding path program 1 times [2022-07-22 12:52:02,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:02,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898086493] [2022-07-22 12:52:02,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:02,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:02,598 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:02,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:02,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:02,617 INFO L85 PathProgramCache]: Analyzing trace with hash 314, now seen corresponding path program 4 times [2022-07-22 12:52:02,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:02,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745957512] [2022-07-22 12:52:02,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:02,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:02,621 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:02,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:02,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:02,624 INFO L85 PathProgramCache]: Analyzing trace with hash -178474100, now seen corresponding path program 1 times [2022-07-22 12:52:02,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:02,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414557191] [2022-07-22 12:52:02,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:02,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:02,640 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:02,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:02,670 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:02,670 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:02,670 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:02,670 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:02,670 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:52:02,670 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:02,670 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:02,670 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:02,671 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration5_Loop [2022-07-22 12:52:02,671 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:02,671 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:02,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:02,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:52:02,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:52:02,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:02,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:52:02,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:52:02,723 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:02,723 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:52:02,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:02,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:02,725 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:52:02,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:02,733 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:02,748 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:52:02,753 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:02,753 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:52:02,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:02,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:02,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:02,783 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:52:02,784 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:52:02,784 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:02,784 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:02,799 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:02,799 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:52:02,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-22 12:52:02,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:02,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:02,824 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:52:02,826 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:02,826 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:02,836 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:52:02,837 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:02,837 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:52:02,860 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:52:02,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:02,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:02,862 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:52:02,864 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:02,864 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:02,879 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:52:02,883 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:02,883 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_9=1} Honda state: {v_rep#funAddr~thread2.offset_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:52:02,912 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:52:02,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:02,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:02,913 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:52:02,916 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:52:02,916 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:02,916 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:02,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-22 12:52:02,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:02,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:02,950 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:52:02,954 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:52:02,954 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:02,964 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:52:02,995 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:52:02,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-07-22 12:52:03,000 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:03,000 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:03,000 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:03,000 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:03,000 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:52:03,000 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:03,000 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:03,000 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:03,000 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration5_Loop [2022-07-22 12:52:03,000 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:03,000 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:03,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:03,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:03,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:03,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:03,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:03,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:03,063 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:03,063 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:52:03,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:03,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:03,064 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:52:03,079 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:52:03,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:03,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:03,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:03,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:03,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:03,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:03,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:03,091 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:52:03,100 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:03,123 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:52:03,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:03,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:03,124 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:52:03,126 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:52:03,135 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:52:03,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:03,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:03,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:03,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:03,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:03,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:03,155 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:03,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-07-22 12:52:03,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:03,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:03,192 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:52:03,197 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:52:03,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:03,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:03,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:03,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:03,207 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:52:03,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:03,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:03,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:03,243 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:52:03,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:03,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:03,244 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:52:03,245 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:52:03,246 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:52:03,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:03,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:03,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:03,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:03,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:03,258 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:03,262 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:03,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-07-22 12:52:03,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:03,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:03,286 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:52:03,287 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:52:03,288 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:52:03,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:03,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:03,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:03,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:03,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:03,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:03,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:03,299 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:52:03,302 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:52:03,302 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:52:03,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:03,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:03,303 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:52:03,304 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:52:03,304 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:52:03,304 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:52:03,304 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:52:03,305 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~x~0) = -2*thread1Thread1of1ForFork1_~x~0 + 19999 Supporting invariants [] [2022-07-22 12:52:03,328 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:52:03,329 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:52:03,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:03,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:52:03,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:03,389 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:52:03,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:03,390 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:52:03,390 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:52:03,391 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 128 transitions. cyclomatic complexity: 103 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:52:03,439 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 128 transitions. cyclomatic complexity: 103. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 67 states and 171 transitions. Complement of second has 3 states. [2022-07-22 12:52:03,439 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:52:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:52:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:52:03,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:52:03,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:03,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:52:03,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:03,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-22 12:52:03,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:03,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 171 transitions. [2022-07-22 12:52:03,450 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2022-07-22 12:52:03,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 62 states and 161 transitions. [2022-07-22 12:52:03,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-07-22 12:52:03,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2022-07-22 12:52:03,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 161 transitions. [2022-07-22 12:52:03,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:52:03,460 INFO L220 hiAutomatonCegarLoop]: Abstraction has 62 states and 161 transitions. [2022-07-22 12:52:03,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 161 transitions. [2022-07-22 12:52:03,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2022-07-22 12:52:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.595744680851064) internal successors, (122), 46 states have internal predecessors, (122), 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:52:03,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 122 transitions. [2022-07-22 12:52:03,466 INFO L242 hiAutomatonCegarLoop]: Abstraction has 47 states and 122 transitions. [2022-07-22 12:52:03,466 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 122 transitions. [2022-07-22 12:52:03,466 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:52:03,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 122 transitions. [2022-07-22 12:52:03,467 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2022-07-22 12:52:03,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:52:03,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:52:03,468 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:52:03,468 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:52:03,469 INFO L748 eck$LassoCheckResult]: Stem: 993#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (= v_~Y~0_53 0) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_53, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 995#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 1019#[thread1ENTRY, L73-4]don't care [246] thread1ENTRY-->L43-2: Formula: (= v_~X~0_12 v_thread1Thread1of1ForFork1_~x~0_21) InVars {~X~0=v_~X~0_12} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_21, ~X~0=v_~X~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0] 967#[L43-2, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 973#[L43-2, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 955#[thread2ENTRY, L43-2, L74-4]don't care [224] thread2ENTRY-->L56-2: Formula: (= v_thread2Thread1of1ForFork0_~x~1_17 v_~X~0_6) InVars {~X~0=v_~X~0_6} OutVars{~X~0=v_~X~0_6, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_17} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1] 957#[L43-2, L74-4, L56-2]don't care [259] L56-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_7| 0) (= v_~Y~0_27 (+ v_~Y~0_28 v_thread2Thread1of1ForFork0_~x~1_29)) (= |v_thread2Thread1of1ForFork0_#res.offset_7| 0) (not (< v_thread2Thread1of1ForFork0_~x~1_29 10000))) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_29, ~Y~0=v_~Y~0_28} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_7|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_7|, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_29, ~Y~0=v_~Y~0_27} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, ~Y~0] 953#[L43-2, L74-4, thread2EXIT]don't care [2022-07-22 12:52:03,469 INFO L750 eck$LassoCheckResult]: Loop: 953#[L43-2, L74-4, thread2EXIT]don't care [283] L43-2-->L43-2: Formula: (and (= v_thread1Thread1of1ForFork1_~x~0_35 (+ v_thread1Thread1of1ForFork1_~x~0_36 1)) (< v_thread1Thread1of1ForFork1_~x~0_36 10000)) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_36} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_35} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 953#[L43-2, L74-4, thread2EXIT]don't care [2022-07-22 12:52:03,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:03,470 INFO L85 PathProgramCache]: Analyzing trace with hash -178475736, now seen corresponding path program 1 times [2022-07-22 12:52:03,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:03,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801809412] [2022-07-22 12:52:03,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:03,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:03,487 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:03,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:03,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:03,503 INFO L85 PathProgramCache]: Analyzing trace with hash 314, now seen corresponding path program 5 times [2022-07-22 12:52:03,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:03,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403202716] [2022-07-22 12:52:03,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:03,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:03,507 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:03,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:03,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:03,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1237780237, now seen corresponding path program 1 times [2022-07-22 12:52:03,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:03,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889905689] [2022-07-22 12:52:03,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:03,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:03,629 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:52:03,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:52:03,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889905689] [2022-07-22 12:52:03,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889905689] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:52:03,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:52:03,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:52:03,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003578209] [2022-07-22 12:52:03,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:52:03,655 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:52:03,675 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:03,675 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:03,675 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:03,675 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:03,675 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:52:03,675 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:03,675 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:03,675 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:03,676 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration6_Loop [2022-07-22 12:52:03,676 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:03,676 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:03,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:03,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:52:03,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:52:03,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:52:03,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:52:03,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:52:03,728 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:52:03,745 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:03,746 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:52:03,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:03,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:03,760 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:52:03,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:03,778 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:52:03,779 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:03,779 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:03,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-07-22 12:52:03,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:03,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:03,838 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:52:03,845 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:52:03,846 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:03,861 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:52:03,911 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:52:03,914 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:52:03,915 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:03,915 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:03,915 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:03,915 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:03,915 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:52:03,915 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:03,915 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:03,915 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:03,916 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration6_Loop [2022-07-22 12:52:03,916 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:03,916 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:03,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:03,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:03,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:03,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:52:03,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:03,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:03,976 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:03,977 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:52:03,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:03,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:03,978 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:52:03,981 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:52:03,981 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:52:03,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:03,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:03,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:03,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:03,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:03,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:03,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:03,991 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:52:03,994 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:52:03,995 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:52:03,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:03,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:03,996 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:52:03,997 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:52:03,997 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:52:03,997 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:52:03,997 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:52:03,997 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~x~0) = -2*thread1Thread1of1ForFork1_~x~0 + 19999 Supporting invariants [] [2022-07-22 12:52:04,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:04,022 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:52:04,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:04,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:52:04,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:04,081 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:52:04,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:04,082 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:52:04,083 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:52:04,083 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 122 transitions. cyclomatic complexity: 98 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:52:04,114 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 122 transitions. cyclomatic complexity: 98. 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 49 states and 124 transitions. Complement of second has 2 states. [2022-07-22 12:52:04,114 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:52:04,116 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:52:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:52:04,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:52:04,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:04,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:52:04,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:04,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:52:04,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:04,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 124 transitions. [2022-07-22 12:52:04,120 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2022-07-22 12:52:04,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 45 states and 111 transitions. [2022-07-22 12:52:04,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2022-07-22 12:52:04,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-07-22 12:52:04,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 111 transitions. [2022-07-22 12:52:04,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:52:04,125 INFO L220 hiAutomatonCegarLoop]: Abstraction has 45 states and 111 transitions. [2022-07-22 12:52:04,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 111 transitions. [2022-07-22 12:52:04,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-07-22 12:52:04,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.466666666666667) internal successors, (111), 44 states have internal predecessors, (111), 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:52:04,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 111 transitions. [2022-07-22 12:52:04,146 INFO L242 hiAutomatonCegarLoop]: Abstraction has 45 states and 111 transitions. [2022-07-22 12:52:04,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:52:04,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:52:04,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:52:04,154 INFO L87 Difference]: Start difference. First operand 45 states and 111 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:52:04,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:52:04,281 INFO L93 Difference]: Finished difference Result 54 states and 134 transitions. [2022-07-22 12:52:04,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 134 transitions. [2022-07-22 12:52:04,286 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2022-07-22 12:52:04,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 134 transitions. [2022-07-22 12:52:04,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-07-22 12:52:04,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-07-22 12:52:04,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 134 transitions. [2022-07-22 12:52:04,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:52:04,291 INFO L220 hiAutomatonCegarLoop]: Abstraction has 54 states and 134 transitions. [2022-07-22 12:52:04,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 134 transitions. [2022-07-22 12:52:04,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2022-07-22 12:52:04,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.466666666666667) internal successors, (111), 44 states have internal predecessors, (111), 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:52:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 111 transitions. [2022-07-22 12:52:04,303 INFO L242 hiAutomatonCegarLoop]: Abstraction has 45 states and 111 transitions. [2022-07-22 12:52:04,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 12:52:04,306 INFO L425 stractBuchiCegarLoop]: Abstraction has 45 states and 111 transitions. [2022-07-22 12:52:04,307 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 12:52:04,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 111 transitions. [2022-07-22 12:52:04,308 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2022-07-22 12:52:04,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:52:04,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:52:04,308 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:52:04,308 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:52:04,309 INFO L748 eck$LassoCheckResult]: Stem: 1286#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (= v_~Y~0_53 0) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_53, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1288#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 1322#[thread1ENTRY, L73-4]don't care [246] thread1ENTRY-->L43-2: Formula: (= v_~X~0_12 v_thread1Thread1of1ForFork1_~x~0_21) InVars {~X~0=v_~X~0_12} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_21, ~X~0=v_~X~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0] 1324#[L43-2, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 1352#[L43-2, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 1334#[thread2ENTRY, L43-2, L74-4]don't care [224] thread2ENTRY-->L56-2: Formula: (= v_thread2Thread1of1ForFork0_~x~1_17 v_~X~0_6) InVars {~X~0=v_~X~0_6} OutVars{~X~0=v_~X~0_6, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_17} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1] 1336#[L43-2, L74-4, L56-2]don't care [264] L43-2-->thread1EXIT: Formula: (and (not (< v_thread1Thread1of1ForFork1_~x~0_29 10000)) (= |v_thread1Thread1of1ForFork1_#res.base_7| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_7| 0) (= v_~Y~0_31 (+ v_~Y~0_32 v_thread1Thread1of1ForFork1_~x~0_29))) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_29, ~Y~0=v_~Y~0_32} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_7|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_29, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_7|, ~Y~0=v_~Y~0_31} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset, ~Y~0] 1306#[thread1EXIT, L74-4, L56-2]don't care [2022-07-22 12:52:04,309 INFO L750 eck$LassoCheckResult]: Loop: 1306#[thread1EXIT, L74-4, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_36 1) v_thread2Thread1of1ForFork0_~x~1_35) (< v_thread2Thread1of1ForFork0_~x~1_36 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_36} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_35, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 1306#[thread1EXIT, L74-4, L56-2]don't care [2022-07-22 12:52:04,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:04,310 INFO L85 PathProgramCache]: Analyzing trace with hash -178475731, now seen corresponding path program 1 times [2022-07-22 12:52:04,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:04,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839501908] [2022-07-22 12:52:04,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:04,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:04,347 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:04,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:04,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:04,369 INFO L85 PathProgramCache]: Analyzing trace with hash 313, now seen corresponding path program 2 times [2022-07-22 12:52:04,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:04,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685022790] [2022-07-22 12:52:04,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:04,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:04,373 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:04,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:04,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:04,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1237780083, now seen corresponding path program 1 times [2022-07-22 12:52:04,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:04,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476268053] [2022-07-22 12:52:04,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:04,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:04,410 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:52:04,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:52:04,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476268053] [2022-07-22 12:52:04,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476268053] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:52:04,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:52:04,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:52:04,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100788442] [2022-07-22 12:52:04,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:52:04,420 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:04,421 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:04,421 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:04,421 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:04,421 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:52:04,421 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:04,421 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:04,421 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:04,421 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration7_Loop [2022-07-22 12:52:04,421 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:04,421 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:04,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:04,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:04,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:04,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:52:04,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:04,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:04,474 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:04,474 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:52:04,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:04,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:04,475 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:52:04,478 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:04,478 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:04,489 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:52:04,498 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:04,499 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_#t~post2=0} Honda state: {thread2Thread1of1ForFork0_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:52:04,538 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:52:04,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:04,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:04,539 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:52:04,540 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:52:04,541 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:04,541 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:04,567 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:04,567 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:52:04,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2022-07-22 12:52:04,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:04,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:04,604 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:52:04,605 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:52:04,606 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:04,606 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:04,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:04,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:04,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:04,637 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:52:04,642 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:52:04,643 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:52:04,643 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:04,678 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:52:04,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-07-22 12:52:04,681 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:04,681 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:04,681 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:04,681 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:04,681 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:52:04,681 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:04,681 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:04,681 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:04,681 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration7_Loop [2022-07-22 12:52:04,681 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:04,681 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:04,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:52: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:52: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:52:04,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:52:04,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:52:04,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:04,743 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:04,744 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:52:04,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:04,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:04,745 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:52:04,748 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:52:04,749 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:52:04,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:04,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:04,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:04,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:04,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:04,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:04,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:04,774 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:04,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:04,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:04,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:04,807 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:52:04,808 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:52:04,809 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:52:04,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:04,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:04,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:04,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:04,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:04,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:04,825 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:04,862 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:52:04,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:04,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:04,863 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:52:04,868 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:52:04,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:04,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:04,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:04,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:04,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:04,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:04,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:04,882 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:52:04,890 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:52:04,895 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:52:04,896 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:52:04,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:04,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:04,901 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:52:04,903 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:52:04,903 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:52:04,903 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:52:04,903 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~x~1) = -2*thread2Thread1of1ForFork0_~x~1 + 19999 Supporting invariants [] [2022-07-22 12:52:04,916 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:52:04,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:04,943 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:52:04,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:04,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:52:04,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:04,990 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:52:04,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:04,991 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:52:04,991 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:52:04,991 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 111 transitions. cyclomatic complexity: 87 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:52:05,023 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 111 transitions. cyclomatic complexity: 87. 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 56 states and 131 transitions. Complement of second has 3 states. [2022-07-22 12:52:05,023 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:52:05,024 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:52:05,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 11 transitions. [2022-07-22 12:52:05,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:52:05,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:05,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:52:05,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:05,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:52:05,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:05,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 131 transitions. [2022-07-22 12:52:05,026 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2022-07-22 12:52:05,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 131 transitions. [2022-07-22 12:52:05,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-22 12:52:05,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-07-22 12:52:05,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 131 transitions. [2022-07-22 12:52:05,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:52:05,029 INFO L220 hiAutomatonCegarLoop]: Abstraction has 56 states and 131 transitions. [2022-07-22 12:52:05,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 131 transitions. [2022-07-22 12:52:05,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2022-07-22 12:52:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.466666666666667) internal successors, (111), 44 states have internal predecessors, (111), 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:52:05,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 111 transitions. [2022-07-22 12:52:05,033 INFO L242 hiAutomatonCegarLoop]: Abstraction has 45 states and 111 transitions. [2022-07-22 12:52:05,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:52:05,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:52:05,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:52:05,034 INFO L87 Difference]: Start difference. First operand 45 states and 111 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:52:05,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:52:05,109 INFO L93 Difference]: Finished difference Result 89 states and 211 transitions. [2022-07-22 12:52:05,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 211 transitions. [2022-07-22 12:52:05,111 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2022-07-22 12:52:05,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 84 states and 201 transitions. [2022-07-22 12:52:05,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2022-07-22 12:52:05,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2022-07-22 12:52:05,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 201 transitions. [2022-07-22 12:52:05,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:52:05,114 INFO L220 hiAutomatonCegarLoop]: Abstraction has 84 states and 201 transitions. [2022-07-22 12:52:05,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 201 transitions. [2022-07-22 12:52:05,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 57. [2022-07-22 12:52:05,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.543859649122807) internal successors, (145), 56 states have internal predecessors, (145), 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:52:05,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 145 transitions. [2022-07-22 12:52:05,119 INFO L242 hiAutomatonCegarLoop]: Abstraction has 57 states and 145 transitions. [2022-07-22 12:52:05,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:52:05,120 INFO L425 stractBuchiCegarLoop]: Abstraction has 57 states and 145 transitions. [2022-07-22 12:52:05,120 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 12:52:05,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 145 transitions. [2022-07-22 12:52:05,121 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2022-07-22 12:52:05,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:52:05,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:52:05,122 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:52:05,122 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:52:05,122 INFO L748 eck$LassoCheckResult]: Stem: 1658#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (= v_~Y~0_53 0) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_53, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1660#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 1700#[thread1ENTRY, L73-4]don't care [246] thread1ENTRY-->L43-2: Formula: (= v_~X~0_12 v_thread1Thread1of1ForFork1_~x~0_21) InVars {~X~0=v_~X~0_12} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_21, ~X~0=v_~X~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0] 1702#[L43-2, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 1728#[L43-2, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 1710#[thread2ENTRY, L43-2, L74-4]don't care [224] thread2ENTRY-->L56-2: Formula: (= v_thread2Thread1of1ForFork0_~x~1_17 v_~X~0_6) InVars {~X~0=v_~X~0_6} OutVars{~X~0=v_~X~0_6, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_17} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1] 1678#[L43-2, L74-4, L56-2]don't care [283] L43-2-->L43-2: Formula: (and (= v_thread1Thread1of1ForFork1_~x~0_35 (+ v_thread1Thread1of1ForFork1_~x~0_36 1)) (< v_thread1Thread1of1ForFork1_~x~0_36 10000)) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_36} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_35} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 1684#[L43-2, L74-4, L56-2]don't care [2022-07-22 12:52:05,123 INFO L750 eck$LassoCheckResult]: Loop: 1684#[L43-2, L74-4, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_36 1) v_thread2Thread1of1ForFork0_~x~1_35) (< v_thread2Thread1of1ForFork0_~x~1_36 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_36} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_35, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 1684#[L43-2, L74-4, L56-2]don't care [2022-07-22 12:52:05,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:05,123 INFO L85 PathProgramCache]: Analyzing trace with hash -178475712, now seen corresponding path program 1 times [2022-07-22 12:52:05,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:05,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702965822] [2022-07-22 12:52:05,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:05,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:05,136 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:05,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:05,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:05,149 INFO L85 PathProgramCache]: Analyzing trace with hash 313, now seen corresponding path program 3 times [2022-07-22 12:52:05,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:05,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431903311] [2022-07-22 12:52:05,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:05,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:05,154 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:05,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:05,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:05,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1237779494, now seen corresponding path program 1 times [2022-07-22 12:52:05,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:05,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35496597] [2022-07-22 12:52:05,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:05,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:05,171 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:05,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:05,193 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:05,194 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:05,194 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:05,194 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:05,194 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:52:05,194 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:05,194 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:05,194 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:05,194 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration8_Loop [2022-07-22 12:52:05,194 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:05,195 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:05,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:52:05,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:05,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:05,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:05,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:05,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:05,246 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:05,246 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:52:05,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:05,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:05,247 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:52:05,257 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:05,257 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:05,272 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:52:05,277 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:05,277 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_15=-1} Honda state: {v_rep#funAddr~thread2.base_15=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:52:05,315 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:52:05,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:05,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:05,317 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:52:05,319 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:05,319 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:05,326 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:52:05,342 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:05,342 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_15=1} Honda state: {v_rep#funAddr~thread2.offset_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:52:05,376 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:52:05,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:05,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:05,378 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:52:05,381 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:05,381 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:05,390 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:52:05,400 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:05,400 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_15=-1} Honda state: {v_rep#funAddr~thread1.base_15=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:52:05,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2022-07-22 12:52:05,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:05,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:05,423 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:52:05,424 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:52:05,424 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:05,424 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:05,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:05,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:05,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:05,455 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:52:05,456 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:52:05,457 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:52:05,457 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:05,496 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:52:05,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:05,499 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:05,499 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:05,499 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:05,499 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:05,499 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:52:05,499 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:05,499 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:05,499 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:05,499 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration8_Loop [2022-07-22 12:52:05,499 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:05,499 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:05,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:52:05,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:05,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:05,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:52:05,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:05,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:52:05,564 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:05,564 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:52:05,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:05,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:05,566 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:52:05,566 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:52:05,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:52:05,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:05,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:05,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:05,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:05,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:05,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:05,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:05,630 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:52:05,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:05,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:05,631 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:52:05,638 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:52:05,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:05,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:05,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:05,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:05,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:05,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:05,654 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:52:05,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:05,706 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:52:05,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:05,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:05,708 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:52:05,711 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:52:05,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:05,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:05,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:05,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:05,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:05,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:05,727 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:52:05,736 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:05,771 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:52:05,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:05,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:05,772 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:52:05,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:52:05,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:05,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:05,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:05,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:05,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:05,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:05,789 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:52:05,798 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:05,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:05,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:05,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:05,825 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:52:05,826 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:52:05,828 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:52:05,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:05,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:05,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:05,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:05,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:05,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:05,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:05,862 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:52:05,867 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:52:05,867 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:52:05,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:05,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:05,869 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:52:05,869 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:52:05,870 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:52:05,870 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:52:05,870 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:52:05,870 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~x~1) = -2*thread2Thread1of1ForFork0_~x~1 + 19999 Supporting invariants [] [2022-07-22 12:52:05,893 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:52:05,894 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:52:05,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:05,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:52:05,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:05,968 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:52:05,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:05,969 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:52:05,971 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:52:05,971 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 145 transitions. cyclomatic complexity: 111 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:52:06,007 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 145 transitions. cyclomatic complexity: 111. 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 94 states and 241 transitions. Complement of second has 3 states. [2022-07-22 12:52:06,007 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:52:06,008 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:52:06,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 13 transitions. [2022-07-22 12:52:06,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:52:06,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:06,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:52:06,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:06,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:52:06,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:06,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 241 transitions. [2022-07-22 12:52:06,012 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2022-07-22 12:52:06,012 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:52:06,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 241 transitions. [2022-07-22 12:52:06,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-07-22 12:52:06,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2022-07-22 12:52:06,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 241 transitions. [2022-07-22 12:52:06,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:52:06,020 INFO L220 hiAutomatonCegarLoop]: Abstraction has 94 states and 241 transitions. [2022-07-22 12:52:06,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 241 transitions. [2022-07-22 12:52:06,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2022-07-22 12:52:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 2.6911764705882355) internal successors, (183), 67 states have internal predecessors, (183), 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:52:06,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 183 transitions. [2022-07-22 12:52:06,028 INFO L242 hiAutomatonCegarLoop]: Abstraction has 68 states and 183 transitions. [2022-07-22 12:52:06,028 INFO L425 stractBuchiCegarLoop]: Abstraction has 68 states and 183 transitions. [2022-07-22 12:52:06,029 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 12:52:06,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 183 transitions. [2022-07-22 12:52:06,030 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2022-07-22 12:52:06,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:52:06,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:52:06,031 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:52:06,031 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:52:06,032 INFO L748 eck$LassoCheckResult]: Stem: 1900#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (= v_~Y~0_53 0) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_53, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1902#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 1948#[thread1ENTRY, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 1952#[thread1ENTRY, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 1964#[thread1ENTRY, thread2ENTRY, L74-4]don't care [224] thread2ENTRY-->L56-2: Formula: (= v_thread2Thread1of1ForFork0_~x~1_17 v_~X~0_6) InVars {~X~0=v_~X~0_6} OutVars{~X~0=v_~X~0_6, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_17} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1] 1966#[thread1ENTRY, L74-4, L56-2]don't care [276] L74-4-->L75-1: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (select |v_#length_37| |v_ULTIMATE.start_main_~#t1~0#1.base_25|)) (= (select |v_#valid_62| |v_ULTIMATE.start_main_~#t1~0#1.base_25|) 1) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (= |v_ULTIMATE.start_main_#t~mem8#1_14| (select (select |v_#memory_int_31| |v_ULTIMATE.start_main_~#t1~0#1.base_25|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21|))) InVars {#valid=|v_#valid_62|, #memory_int=|v_#memory_int_31|, #length=|v_#length_37|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_17|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_14|, #valid=|v_#valid_62|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_9|, #memory_int=|v_#memory_int_31|, #length=|v_#length_37|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~nondet7#1] 1982#[thread1ENTRY, L75-1, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_36 1) v_thread2Thread1of1ForFork0_~x~1_35) (< v_thread2Thread1of1ForFork0_~x~1_36 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_36} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_35, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 1910#[thread1ENTRY, L75-1, L56-2]don't care [2022-07-22 12:52:06,032 INFO L750 eck$LassoCheckResult]: Loop: 1910#[thread1ENTRY, L75-1, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_36 1) v_thread2Thread1of1ForFork0_~x~1_35) (< v_thread2Thread1of1ForFork0_~x~1_36 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_36} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_35, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 1910#[thread1ENTRY, L75-1, L56-2]don't care [2022-07-22 12:52:06,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:06,032 INFO L85 PathProgramCache]: Analyzing trace with hash -143553283, now seen corresponding path program 1 times [2022-07-22 12:52:06,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:06,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329615218] [2022-07-22 12:52:06,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:06,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:06,053 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:06,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:06,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:06,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:06,083 INFO L85 PathProgramCache]: Analyzing trace with hash 313, now seen corresponding path program 4 times [2022-07-22 12:52:06,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:06,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386216810] [2022-07-22 12:52:06,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:06,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:06,086 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:06,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:06,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:06,090 INFO L85 PathProgramCache]: Analyzing trace with hash -155184195, now seen corresponding path program 2 times [2022-07-22 12:52:06,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:06,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750961852] [2022-07-22 12:52:06,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:06,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:06,102 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:06,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:06,123 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:06,123 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:06,123 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:06,123 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:06,124 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:52:06,124 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:06,124 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:06,124 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:06,124 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration9_Loop [2022-07-22 12:52:06,124 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:06,124 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:06,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:06,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:06,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:06,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:06,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:06,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:06,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:06,171 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:06,172 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:52:06,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:06,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:06,173 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:52:06,178 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:06,178 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:06,188 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:52:06,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:06,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:06,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:06,219 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:52:06,220 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:52:06,220 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:52:06,220 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:06,258 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:52:06,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2022-07-22 12:52:06,260 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:06,260 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:06,260 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:06,260 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:06,261 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:52:06,261 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:06,261 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:06,261 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:06,261 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration9_Loop [2022-07-22 12:52:06,261 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:06,261 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:06,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:52:06,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:52:06,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:52:06,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:52:06,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:52:06,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:52:06,320 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:06,320 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:52:06,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:06,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:06,322 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:52:06,323 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:52:06,323 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:52:06,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:06,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:06,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:06,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:06,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:06,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:06,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:06,333 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:52:06,336 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:52:06,336 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:52:06,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:06,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:06,337 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:52:06,340 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:52:06,340 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:52:06,340 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:52:06,340 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~x~1) = -2*thread2Thread1of1ForFork0_~x~1 + 19999 Supporting invariants [] [2022-07-22 12:52:06,341 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:52:06,368 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:52:06,370 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:52:06,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:06,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:52:06,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:06,415 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:52:06,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:06,416 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:52:06,417 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:52:06,417 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 183 transitions. cyclomatic complexity: 142 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:52:06,462 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 183 transitions. cyclomatic complexity: 142. 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 131 states and 353 transitions. Complement of second has 3 states. [2022-07-22 12:52:06,463 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:52:06,464 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:52:06,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 13 transitions. [2022-07-22 12:52:06,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:52:06,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:06,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:52:06,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:06,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:52:06,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:06,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 353 transitions. [2022-07-22 12:52:06,470 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2022-07-22 12:52:06,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 128 states and 348 transitions. [2022-07-22 12:52:06,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2022-07-22 12:52:06,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2022-07-22 12:52:06,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 348 transitions. [2022-07-22 12:52:06,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:52:06,477 INFO L220 hiAutomatonCegarLoop]: Abstraction has 128 states and 348 transitions. [2022-07-22 12:52:06,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 348 transitions. [2022-07-22 12:52:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 97. [2022-07-22 12:52:06,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 2.6804123711340204) internal successors, (260), 96 states have internal predecessors, (260), 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:52:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 260 transitions. [2022-07-22 12:52:06,494 INFO L242 hiAutomatonCegarLoop]: Abstraction has 97 states and 260 transitions. [2022-07-22 12:52:06,494 INFO L425 stractBuchiCegarLoop]: Abstraction has 97 states and 260 transitions. [2022-07-22 12:52:06,495 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 12:52:06,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 260 transitions. [2022-07-22 12:52:06,496 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2022-07-22 12:52:06,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:52:06,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:52:06,497 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-22 12:52:06,497 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:52:06,498 INFO L748 eck$LassoCheckResult]: Stem: 2215#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (= v_~Y~0_53 0) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_53, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2217#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 2251#[thread1ENTRY, L73-4]don't care [246] thread1ENTRY-->L43-2: Formula: (= v_~X~0_12 v_thread1Thread1of1ForFork1_~x~0_21) InVars {~X~0=v_~X~0_12} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_21, ~X~0=v_~X~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0] 2253#[L43-2, L73-4]don't care [283] L43-2-->L43-2: Formula: (and (= v_thread1Thread1of1ForFork1_~x~0_35 (+ v_thread1Thread1of1ForFork1_~x~0_36 1)) (< v_thread1Thread1of1ForFork1_~x~0_36 10000)) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_36} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_35} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 2285#[L43-2, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 2289#[L43-2, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 2263#[thread2ENTRY, L43-2, L74-4]don't care [224] thread2ENTRY-->L56-2: Formula: (= v_thread2Thread1of1ForFork0_~x~1_17 v_~X~0_6) InVars {~X~0=v_~X~0_6} OutVars{~X~0=v_~X~0_6, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_17} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1] 2265#[L43-2, L74-4, L56-2]don't care [283] L43-2-->L43-2: Formula: (and (= v_thread1Thread1of1ForFork1_~x~0_35 (+ v_thread1Thread1of1ForFork1_~x~0_36 1)) (< v_thread1Thread1of1ForFork1_~x~0_36 10000)) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_36} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_35} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 2319#[L43-2, L74-4, L56-2]don't care [2022-07-22 12:52:06,498 INFO L750 eck$LassoCheckResult]: Loop: 2319#[L43-2, L74-4, L56-2]don't care [283] L43-2-->L43-2: Formula: (and (= v_thread1Thread1of1ForFork1_~x~0_35 (+ v_thread1Thread1of1ForFork1_~x~0_36 1)) (< v_thread1Thread1of1ForFork1_~x~0_36 10000)) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_36} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_35} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 2319#[L43-2, L74-4, L56-2]don't care [2022-07-22 12:52:06,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:06,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1238531863, now seen corresponding path program 2 times [2022-07-22 12:52:06,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:06,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564858924] [2022-07-22 12:52:06,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:06,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:06,514 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:06,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:06,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:06,535 INFO L85 PathProgramCache]: Analyzing trace with hash 314, now seen corresponding path program 6 times [2022-07-22 12:52:06,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:06,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731508756] [2022-07-22 12:52:06,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:06,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:06,540 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:06,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:06,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:06,545 INFO L85 PathProgramCache]: Analyzing trace with hash 260218194, now seen corresponding path program 3 times [2022-07-22 12:52:06,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:06,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766818872] [2022-07-22 12:52:06,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:06,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:06,559 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:06,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:06,594 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:06,594 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:06,594 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:06,594 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:06,594 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:52:06,594 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:06,594 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:06,595 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:06,595 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration10_Loop [2022-07-22 12:52:06,595 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:06,595 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:06,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:06,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:06,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:06,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:06,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:06,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:06,655 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:06,655 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:52:06,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:06,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:06,659 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:52:06,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:06,662 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:06,677 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:52:06,682 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:06,682 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_19=0} Honda state: {v_rep#funAddr~thread1.offset_19=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:52:06,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:06,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:06,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:06,719 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:52:06,721 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:06,721 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:06,735 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:52:06,740 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:06,740 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_19=-1} Honda state: {v_rep#funAddr~thread2.base_19=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:52:06,779 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:52:06,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:06,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:06,781 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:52:06,785 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:06,785 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:06,801 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:52:06,806 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:06,806 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_19=-1} Honda state: {v_rep#funAddr~thread1.base_19=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:52:06,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:06,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:06,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:06,845 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:52:06,847 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:06,847 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:06,859 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:52:06,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:06,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:06,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:06,906 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:52:06,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:52:06,909 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:06,923 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:52:06,949 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:52:06,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2022-07-22 12:52:06,952 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:06,952 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:06,952 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:06,952 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:06,952 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:52:06,952 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:06,952 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:06,952 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:06,952 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration10_Loop [2022-07-22 12:52:06,952 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:06,953 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:06,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:52:06,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:06,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:06,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:52:06,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:52:06,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:52:07,013 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:07,013 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:52:07,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:07,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:07,014 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:52: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:52:07,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:07,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:07,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:07,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:07,036 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:07,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:07,035 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:52:07,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:07,090 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:52:07,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:07,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:07,091 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:52:07,093 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:52:07,100 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:52:07,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:07,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:07,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:07,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:07,102 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:07,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:07,110 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:07,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2022-07-22 12:52:07,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:07,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:07,132 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:52:07,133 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:52:07,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:52:07,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:07,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:07,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:07,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:07,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:07,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:07,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:07,150 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:52:07,153 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:52:07,153 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:52:07,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:07,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:07,154 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:52:07,164 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:52:07,164 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:52:07,164 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:52:07,164 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~x~0) = -2*thread1Thread1of1ForFork1_~x~0 + 19999 Supporting invariants [] [2022-07-22 12:52:07,179 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:52:07,199 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:52:07,200 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:52:07,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:07,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:52:07,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:07,240 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:52:07,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:07,240 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:52:07,241 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:52:07,241 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 260 transitions. cyclomatic complexity: 197 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:52:07,275 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 260 transitions. cyclomatic complexity: 197. 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 153 states and 400 transitions. Complement of second has 3 states. [2022-07-22 12:52:07,275 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:52:07,276 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:52:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 13 transitions. [2022-07-22 12:52:07,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:52:07,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:07,276 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:52:07,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:07,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:52:07,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:07,313 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:52:07,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:07,313 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:52:07,314 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:52:07,314 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 260 transitions. cyclomatic complexity: 197 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:52:07,343 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 260 transitions. cyclomatic complexity: 197. 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 153 states and 400 transitions. Complement of second has 3 states. [2022-07-22 12:52:07,344 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:52:07,344 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:52:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 13 transitions. [2022-07-22 12:52:07,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:52:07,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:07,345 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:52:07,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:07,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:52:07,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:07,381 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:52:07,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:07,381 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:52:07,382 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:52:07,382 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 260 transitions. cyclomatic complexity: 197 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:52:07,414 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 260 transitions. cyclomatic complexity: 197. 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 126 states and 347 transitions. Complement of second has 2 states. [2022-07-22 12:52:07,415 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:52:07,415 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:52:07,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:52:07,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:52:07,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:07,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 9 letters. Loop has 1 letters. [2022-07-22 12:52:07,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:07,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:52:07,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:07,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 347 transitions. [2022-07-22 12:52:07,419 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 15 [2022-07-22 12:52:07,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 347 transitions. [2022-07-22 12:52:07,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2022-07-22 12:52:07,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2022-07-22 12:52:07,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 347 transitions. [2022-07-22 12:52:07,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:52:07,422 INFO L220 hiAutomatonCegarLoop]: Abstraction has 126 states and 347 transitions. [2022-07-22 12:52:07,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 347 transitions. [2022-07-22 12:52:07,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 103. [2022-07-22 12:52:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 2.7281553398058254) internal successors, (281), 102 states have internal predecessors, (281), 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:52:07,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 281 transitions. [2022-07-22 12:52:07,427 INFO L242 hiAutomatonCegarLoop]: Abstraction has 103 states and 281 transitions. [2022-07-22 12:52:07,427 INFO L425 stractBuchiCegarLoop]: Abstraction has 103 states and 281 transitions. [2022-07-22 12:52:07,427 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-22 12:52:07,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 281 transitions. [2022-07-22 12:52:07,429 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 13 [2022-07-22 12:52:07,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:52:07,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:52:07,429 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-22 12:52:07,429 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:52:07,430 INFO L748 eck$LassoCheckResult]: Stem: 2939#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (= v_~Y~0_53 0) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_53, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2941#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 2975#[thread1ENTRY, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 2979#[thread1ENTRY, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 2997#[thread1ENTRY, thread2ENTRY, L74-4]don't care [224] thread2ENTRY-->L56-2: Formula: (= v_thread2Thread1of1ForFork0_~x~1_17 v_~X~0_6) InVars {~X~0=v_~X~0_6} OutVars{~X~0=v_~X~0_6, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_17} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1] 2999#[thread1ENTRY, L74-4, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_36 1) v_thread2Thread1of1ForFork0_~x~1_35) (< v_thread2Thread1of1ForFork0_~x~1_36 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_36} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_35, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 3021#[thread1ENTRY, L74-4, L56-2]don't care [276] L74-4-->L75-1: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (select |v_#length_37| |v_ULTIMATE.start_main_~#t1~0#1.base_25|)) (= (select |v_#valid_62| |v_ULTIMATE.start_main_~#t1~0#1.base_25|) 1) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (= |v_ULTIMATE.start_main_#t~mem8#1_14| (select (select |v_#memory_int_31| |v_ULTIMATE.start_main_~#t1~0#1.base_25|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21|))) InVars {#valid=|v_#valid_62|, #memory_int=|v_#memory_int_31|, #length=|v_#length_37|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_17|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_14|, #valid=|v_#valid_62|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_9|, #memory_int=|v_#memory_int_31|, #length=|v_#length_37|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~nondet7#1] 3023#[thread1ENTRY, L75-1, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_36 1) v_thread2Thread1of1ForFork0_~x~1_35) (< v_thread2Thread1of1ForFork0_~x~1_36 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_36} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_35, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 2943#[thread1ENTRY, L75-1, L56-2]don't care [2022-07-22 12:52:07,430 INFO L750 eck$LassoCheckResult]: Loop: 2943#[thread1ENTRY, L75-1, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_36 1) v_thread2Thread1of1ForFork0_~x~1_35) (< v_thread2Thread1of1ForFork0_~x~1_36 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_36} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_35, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 2943#[thread1ENTRY, L75-1, L56-2]don't care [2022-07-22 12:52:07,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:07,431 INFO L85 PathProgramCache]: Analyzing trace with hash -155178615, now seen corresponding path program 3 times [2022-07-22 12:52:07,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:07,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481765714] [2022-07-22 12:52:07,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:07,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:07,442 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:07,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:07,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:07,454 INFO L85 PathProgramCache]: Analyzing trace with hash 313, now seen corresponding path program 5 times [2022-07-22 12:52:07,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:07,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588289457] [2022-07-22 12:52:07,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:07,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:07,458 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:07,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:07,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:07,461 INFO L85 PathProgramCache]: Analyzing trace with hash -515569487, now seen corresponding path program 4 times [2022-07-22 12:52:07,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:07,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710715060] [2022-07-22 12:52:07,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:07,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:07,472 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:07,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:07,494 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:07,494 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:07,494 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:07,494 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:07,494 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:52:07,494 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:07,494 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:07,495 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:07,495 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration11_Loop [2022-07-22 12:52:07,495 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:07,495 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:07,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:07,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:52:07,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:07,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:07,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:07,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:07,543 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:07,543 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:52:07,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:07,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:07,544 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:52:07,546 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:07,546 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:07,557 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:52:07,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2022-07-22 12:52:07,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:07,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:07,598 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:52:07,599 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:52:07,599 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:52:07,599 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:07,634 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:52:07,636 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:52:07,636 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:07,636 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:07,636 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:07,636 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:07,636 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:52:07,636 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:07,652 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:07,652 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:07,652 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration11_Loop [2022-07-22 12:52:07,652 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:07,652 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:07,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:52:07,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:07,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:07,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:07,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:07,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:07,694 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:52:07,715 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:07,715 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:52:07,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:07,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:07,717 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:52:07,719 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:52:07,724 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:52:07,725 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:52:07,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:07,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:07,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:07,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:07,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:07,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:07,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:07,729 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:52:07,731 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:52:07,732 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:52:07,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:07,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:07,733 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:52:07,734 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:52:07,735 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:52:07,735 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:52:07,735 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:52:07,735 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~x~1) = -2*thread2Thread1of1ForFork0_~x~1 + 19999 Supporting invariants [] [2022-07-22 12:52:07,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2022-07-22 12:52:07,757 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:52:07,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:07,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:52:07,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:07,797 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:52:07,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:07,798 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:52:07,798 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:52:07,799 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 103 states and 281 transitions. cyclomatic complexity: 212 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:52:07,835 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 103 states and 281 transitions. cyclomatic complexity: 212. 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 125 states and 341 transitions. Complement of second has 3 states. [2022-07-22 12:52:07,836 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:52:07,836 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:52:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:52:07,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:52:07,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:07,837 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:52:07,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:07,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:52:07,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:07,876 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:52:07,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:07,877 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:52:07,877 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:52:07,878 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 103 states and 281 transitions. cyclomatic complexity: 212 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:52:07,906 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 103 states and 281 transitions. cyclomatic complexity: 212. 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 125 states and 341 transitions. Complement of second has 3 states. [2022-07-22 12:52:07,907 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:52:07,908 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:52:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:52:07,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:52:07,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:07,908 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:52:07,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:07,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:52:07,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:07,945 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:52:07,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:07,946 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:52:07,947 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:52:07,947 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 103 states and 281 transitions. cyclomatic complexity: 212 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:52:07,977 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 103 states and 281 transitions. cyclomatic complexity: 212. 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 139 states and 372 transitions. Complement of second has 2 states. [2022-07-22 12:52:07,977 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:52:07,977 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:52:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2022-07-22 12:52:07,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:52:07,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:07,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 9 letters. Loop has 1 letters. [2022-07-22 12:52:07,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:07,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:52:07,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:07,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 372 transitions. [2022-07-22 12:52:07,982 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-07-22 12:52:07,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 99 states and 229 transitions. [2022-07-22 12:52:07,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2022-07-22 12:52:07,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2022-07-22 12:52:07,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 229 transitions. [2022-07-22 12:52:07,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:52:07,984 INFO L220 hiAutomatonCegarLoop]: Abstraction has 99 states and 229 transitions. [2022-07-22 12:52:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 229 transitions. [2022-07-22 12:52:07,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 70. [2022-07-22 12:52:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 2.357142857142857) internal successors, (165), 69 states have internal predecessors, (165), 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:52:07,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 165 transitions. [2022-07-22 12:52:07,988 INFO L242 hiAutomatonCegarLoop]: Abstraction has 70 states and 165 transitions. [2022-07-22 12:52:07,988 INFO L425 stractBuchiCegarLoop]: Abstraction has 70 states and 165 transitions. [2022-07-22 12:52:07,988 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-22 12:52:07,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 165 transitions. [2022-07-22 12:52:07,989 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-22 12:52:07,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:52:07,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:52:07,990 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:52:07,990 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:52:07,991 INFO L748 eck$LassoCheckResult]: Stem: 3618#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (= v_~Y~0_53 0) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_53, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3620#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 3644#[thread1ENTRY, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 3648#[thread1ENTRY, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 3658#[thread1ENTRY, thread2ENTRY, L74-4]don't care [224] thread2ENTRY-->L56-2: Formula: (= v_thread2Thread1of1ForFork0_~x~1_17 v_~X~0_6) InVars {~X~0=v_~X~0_6} OutVars{~X~0=v_~X~0_6, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_17} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1] 3660#[thread1ENTRY, L74-4, L56-2]don't care [246] thread1ENTRY-->L43-2: Formula: (= v_~X~0_12 v_thread1Thread1of1ForFork1_~x~0_21) InVars {~X~0=v_~X~0_12} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_21, ~X~0=v_~X~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0] 3678#[L43-2, L74-4, L56-2]don't care [283] L43-2-->L43-2: Formula: (and (= v_thread1Thread1of1ForFork1_~x~0_35 (+ v_thread1Thread1of1ForFork1_~x~0_36 1)) (< v_thread1Thread1of1ForFork1_~x~0_36 10000)) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_36} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_35} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 3722#[L43-2, L74-4, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_36 1) v_thread2Thread1of1ForFork0_~x~1_35) (< v_thread2Thread1of1ForFork0_~x~1_36 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_36} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_35, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 3628#[L43-2, L74-4, L56-2]don't care [2022-07-22 12:52:07,991 INFO L750 eck$LassoCheckResult]: Loop: 3628#[L43-2, L74-4, L56-2]don't care [283] L43-2-->L43-2: Formula: (and (= v_thread1Thread1of1ForFork1_~x~0_35 (+ v_thread1Thread1of1ForFork1_~x~0_36 1)) (< v_thread1Thread1of1ForFork1_~x~0_36 10000)) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_36} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_35} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 3634#[L43-2, L74-4, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_36 1) v_thread2Thread1of1ForFork0_~x~1_35) (< v_thread2Thread1of1ForFork0_~x~1_36 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_36} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_35, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 3628#[L43-2, L74-4, L56-2]don't care [2022-07-22 12:52:07,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:07,992 INFO L85 PathProgramCache]: Analyzing trace with hash -155212994, now seen corresponding path program 2 times [2022-07-22 12:52:07,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:07,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549499069] [2022-07-22 12:52:07,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:07,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:08,003 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:08,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:08,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:08,014 INFO L85 PathProgramCache]: Analyzing trace with hash 10016, now seen corresponding path program 1 times [2022-07-22 12:52:08,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:08,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652085544] [2022-07-22 12:52:08,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:08,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:08,018 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:08,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:08,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:08,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1164177181, now seen corresponding path program 3 times [2022-07-22 12:52:08,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:08,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910058872] [2022-07-22 12:52:08,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:08,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:08,032 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:08,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:08,061 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:08,061 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:08,061 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:08,061 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:08,061 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:52:08,061 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:08,061 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:08,061 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:08,061 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration12_Loop [2022-07-22 12:52:08,062 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:08,062 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:08,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,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:52:08,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,126 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:08,127 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:52:08,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:08,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:08,129 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:52:08,134 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:52:08,135 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:08,135 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:08,165 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:52:08,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:08,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:08,166 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:52:08,167 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:52:08,167 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:52:08,168 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:08,205 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:52:08,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2022-07-22 12:52:08,208 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:08,208 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:08,208 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:08,208 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:08,208 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:52:08,208 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:08,208 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:08,208 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:08,209 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration12_Loop [2022-07-22 12:52:08,209 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:08,209 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:08,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,283 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:08,283 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:52:08,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:08,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:08,284 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:52:08,285 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:52:08,286 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:52:08,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:08,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:08,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:08,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:08,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:08,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:08,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:08,295 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:08,318 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:52:08,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:08,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:08,319 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:52:08,320 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:52:08,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:52:08,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:08,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:08,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:08,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:08,330 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:08,330 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:08,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:08,356 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:52:08,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:08,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:08,357 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:52:08,358 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:52:08,358 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:52:08,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:08,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:08,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:08,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:08,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:08,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:08,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:08,369 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:52:08,370 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:52:08,371 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:52:08,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:08,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:08,374 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:52:08,375 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:52:08,375 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:52:08,375 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:52:08,375 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:52:08,375 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~x~0) = -2*thread1Thread1of1ForFork1_~x~0 + 19999 Supporting invariants [] [2022-07-22 12:52:08,397 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:52:08,398 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:52:08,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:08,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:52:08,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:08,448 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:52:08,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:08,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:52:08,495 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:52:08,495 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 165 transitions. cyclomatic complexity: 116 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:52:08,519 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 165 transitions. cyclomatic complexity: 116. 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 248 transitions. Complement of second has 3 states. [2022-07-22 12:52:08,519 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:52:08,520 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:52:08,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 10 transitions. [2022-07-22 12:52:08,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:52:08,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:08,521 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:52:08,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:08,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:52:08,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:08,560 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:52:08,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:08,579 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:52:08,580 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:52:08,580 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 165 transitions. cyclomatic complexity: 116 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:52:08,621 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 165 transitions. cyclomatic complexity: 116. 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 118 states and 284 transitions. Complement of second has 5 states. [2022-07-22 12:52:08,622 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:52:08,622 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:52:08,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-07-22 12:52:08,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:52:08,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:08,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 2 letters. [2022-07-22 12:52:08,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:08,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 8 letters. Loop has 4 letters. [2022-07-22 12:52:08,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:08,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 284 transitions. [2022-07-22 12:52:08,625 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-22 12:52:08,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 106 states and 253 transitions. [2022-07-22 12:52:08,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2022-07-22 12:52:08,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2022-07-22 12:52:08,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 253 transitions. [2022-07-22 12:52:08,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:52:08,628 INFO L220 hiAutomatonCegarLoop]: Abstraction has 106 states and 253 transitions. [2022-07-22 12:52:08,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 253 transitions. [2022-07-22 12:52:08,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2022-07-22 12:52:08,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 2.391304347826087) internal successors, (220), 91 states have internal predecessors, (220), 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:52:08,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 220 transitions. [2022-07-22 12:52:08,632 INFO L242 hiAutomatonCegarLoop]: Abstraction has 92 states and 220 transitions. [2022-07-22 12:52:08,633 INFO L425 stractBuchiCegarLoop]: Abstraction has 92 states and 220 transitions. [2022-07-22 12:52:08,633 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-22 12:52:08,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 220 transitions. [2022-07-22 12:52:08,634 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-22 12:52:08,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:52:08,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:52:08,634 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:52:08,634 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:52:08,635 INFO L748 eck$LassoCheckResult]: Stem: 4062#[ULTIMATE.startENTRY]don't care [305] ULTIMATE.startENTRY-->L73-3: Formula: (let ((.cse0 (select |v_#memory_int_62| 1)) (.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 1))) (and (= |v_#NULL.offset_6| 0) (= (select |v_#valid_123| 2) 1) (= v_~Y~0_53 0) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_61| 0) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_59| 0) (= (select |v_#valid_123| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_76| 2) 18) (= (select |v_#valid_123| 0) 0) (= (store (store |v_#length_76| |v_ULTIMATE.start_main_~#t1~0#1.base_69| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_71| 4) |v_#length_75|) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) 0) (= |v_#valid_122| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71| 1)) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t1~0#1.base_69|) |v_ULTIMATE.start_main_~#t1~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre4#1_35|))) (= (ite (<= v_~X~0_42 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_71|) 0) (= 2 (select |v_#length_76| 1)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre4#1_35|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (< 0 |v_#StackHeapBarrier_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_62|, #length=|v_#length_76|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_29|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_69|, ~X~0=v_~X~0_42, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_59|, ~Y~0=v_~Y~0_53, #NULL.base=|v_#NULL.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, #valid=|v_#valid_122|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_19|, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_28|, #length=|v_#length_75|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ~Y~0, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4064#[L73-3]don't care [221] L73-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 4086#[thread1ENTRY, L73-4]don't care [286] L73-4-->L74-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre6#1_19|)) |v_#memory_int_37|) (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 4090#[thread1ENTRY, L74-3]don't care [218] L74-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 4102#[thread1ENTRY, thread2ENTRY, L74-4]don't care [224] thread2ENTRY-->L56-2: Formula: (= v_thread2Thread1of1ForFork0_~x~1_17 v_~X~0_6) InVars {~X~0=v_~X~0_6} OutVars{~X~0=v_~X~0_6, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_17} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1] 4104#[thread1ENTRY, L74-4, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_36 1) v_thread2Thread1of1ForFork0_~x~1_35) (< v_thread2Thread1of1ForFork0_~x~1_36 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_36} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_35, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 4124#[thread1ENTRY, L74-4, L56-2]don't care [246] thread1ENTRY-->L43-2: Formula: (= v_~X~0_12 v_thread1Thread1of1ForFork1_~x~0_21) InVars {~X~0=v_~X~0_12} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_21, ~X~0=v_~X~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0] 4128#[L43-2, L74-4, L56-2]don't care [283] L43-2-->L43-2: Formula: (and (= v_thread1Thread1of1ForFork1_~x~0_35 (+ v_thread1Thread1of1ForFork1_~x~0_36 1)) (< v_thread1Thread1of1ForFork1_~x~0_36 10000)) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_36} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_35} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 4186#[L43-2, L74-4, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_36 1) v_thread2Thread1of1ForFork0_~x~1_35) (< v_thread2Thread1of1ForFork0_~x~1_36 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_36} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_35, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 4148#[L43-2, L74-4, L56-2]don't care [2022-07-22 12:52:08,636 INFO L750 eck$LassoCheckResult]: Loop: 4148#[L43-2, L74-4, L56-2]don't care [283] L43-2-->L43-2: Formula: (and (= v_thread1Thread1of1ForFork1_~x~0_35 (+ v_thread1Thread1of1ForFork1_~x~0_36 1)) (< v_thread1Thread1of1ForFork1_~x~0_36 10000)) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_36} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_15|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_35} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0] 4150#[L43-2, L74-4, L56-2]don't care [282] L56-2-->L56-2: Formula: (and (= (+ v_thread2Thread1of1ForFork0_~x~1_36 1) v_thread2Thread1of1ForFork0_~x~1_35) (< v_thread2Thread1of1ForFork0_~x~1_36 10000)) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_36} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_35, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2] 4148#[L43-2, L74-4, L56-2]don't care [2022-07-22 12:52:08,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:08,636 INFO L85 PathProgramCache]: Analyzing trace with hash -515598286, now seen corresponding path program 4 times [2022-07-22 12:52:08,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:08,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479829282] [2022-07-22 12:52:08,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:08,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:08,649 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:08,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:08,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:08,661 INFO L85 PathProgramCache]: Analyzing trace with hash 10016, now seen corresponding path program 2 times [2022-07-22 12:52:08,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:08,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111883757] [2022-07-22 12:52:08,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:08,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:08,666 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:08,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:08,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:08,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1568704751, now seen corresponding path program 5 times [2022-07-22 12:52:08,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:08,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341736502] [2022-07-22 12:52:08,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:08,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:08,681 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:08,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:08,712 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:08,712 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:08,712 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:08,712 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:08,712 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:52:08,712 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:08,712 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:08,712 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:08,712 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration13_Loop [2022-07-22 12:52:08,713 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:08,713 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:08,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:08,782 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:08,782 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:52:08,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:08,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:08,783 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:52:08,789 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:08,789 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:08,803 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:52:08,808 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:08,808 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_25=1} Honda state: {v_rep#funAddr~thread2.offset_25=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:52:08,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2022-07-22 12:52:08,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:08,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:08,836 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:52:08,837 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:52:08,837 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:08,837 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:08,847 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:08,848 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:52:08,870 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:52:08,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:08,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:08,871 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:52:08,872 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:52:08,873 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:08,873 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:08,882 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:08,883 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_#t~post2=0} Honda state: {thread2Thread1of1ForFork0_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:52:08,905 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:52:08,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:08,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:08,907 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:52:08,907 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:52:08,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:08,908 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:08,923 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:52:08,923 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:52:08,946 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:52:08,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:08,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:08,947 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:52:08,948 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:52:08,949 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:52:08,949 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:08,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2022-07-22 12:52:08,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:08,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:08,981 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:52:08,982 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:52:08,983 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:52:08,983 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:52:09,047 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:52:09,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:09,051 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:09,051 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:09,051 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:09,051 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:09,051 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:52:09,051 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:09,051 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:09,051 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:09,051 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration13_Loop [2022-07-22 12:52:09,051 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:09,052 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:09,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:52:09,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:09,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:52:09,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:09,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:52:09,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:09,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:52:09,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:09,126 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:09,126 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:52:09,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:09,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:09,128 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:52:09,129 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:52:09,129 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:52:09,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:09,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:09,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:09,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:09,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:09,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:09,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:09,174 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:52:09,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:09,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:09,175 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:52:09,176 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:52:09,176 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:52:09,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:09,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:09,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:09,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:09,187 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:09,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:09,198 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:09,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:09,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:09,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:09,235 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:52:09,242 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:52:09,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:09,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:09,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:09,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:09,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:09,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:09,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:09,254 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:52:09,262 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:09,298 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:52:09,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:09,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:09,300 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:52:09,300 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:52:09,301 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:52:09,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:09,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:09,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:09,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:09,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:09,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:09,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:09,311 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:52:09,314 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:52:09,314 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:52:09,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:09,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:09,315 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:52:09,316 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:52:09,316 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:52:09,317 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:52:09,317 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:52:09,317 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~x~1) = -2*thread2Thread1of1ForFork0_~x~1 + 19999 Supporting invariants [] [2022-07-22 12:52:09,340 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:52:09,341 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:52:09,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:09,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:52:09,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:09,389 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:52:09,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:09,392 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:52:09,392 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:52:09,393 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 220 transitions. cyclomatic complexity: 153 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:52:09,419 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 220 transitions. cyclomatic complexity: 153. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 135 states and 350 transitions. Complement of second has 4 states. [2022-07-22 12:52:09,420 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:52:09,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:52:09,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-07-22 12:52:09,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-22 12:52:09,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:09,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-22 12:52:09,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:09,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 9 letters. Loop has 4 letters. [2022-07-22 12:52:09,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:09,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 350 transitions. [2022-07-22 12:52:09,424 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 12:52:09,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 0 states and 0 transitions. [2022-07-22 12:52:09,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-22 12:52:09,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-22 12:52:09,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-22 12:52:09,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:52:09,425 INFO L220 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 12:52:09,425 INFO L242 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 12:52:09,425 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 12:52:09,425 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-22 12:52:09,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-22 12:52:09,425 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 12:52:09,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-22 12:52:09,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 12:52:09 BoogieIcfgContainer [2022-07-22 12:52:09,436 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 12:52:09,437 INFO L158 Benchmark]: Toolchain (without parser) took 15707.67ms. Allocated memory was 151.0MB in the beginning and 223.3MB in the end (delta: 72.4MB). Free memory was 126.9MB in the beginning and 80.0MB in the end (delta: 46.9MB). Peak memory consumption was 120.3MB. Max. memory is 8.0GB. [2022-07-22 12:52:09,437 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 151.0MB. Free memory is still 121.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:52:09,438 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.04ms. Allocated memory is still 151.0MB. Free memory was 126.7MB in the beginning and 116.6MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-07-22 12:52:09,438 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.14ms. Allocated memory is still 151.0MB. Free memory was 116.4MB in the beginning and 115.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:52:09,439 INFO L158 Benchmark]: Boogie Preprocessor took 31.13ms. Allocated memory is still 151.0MB. Free memory was 115.0MB in the beginning and 113.7MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:52:09,439 INFO L158 Benchmark]: RCFGBuilder took 447.55ms. Allocated memory is still 151.0MB. Free memory was 113.7MB in the beginning and 102.4MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 12:52:09,440 INFO L158 Benchmark]: BuchiAutomizer took 14770.37ms. Allocated memory was 151.0MB in the beginning and 223.3MB in the end (delta: 72.4MB). Free memory was 102.2MB in the beginning and 80.0MB in the end (delta: 22.3MB). Peak memory consumption was 95.2MB. Max. memory is 8.0GB. [2022-07-22 12:52:09,442 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.30ms. Allocated memory is still 151.0MB. Free memory is still 121.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 403.04ms. Allocated memory is still 151.0MB. Free memory was 126.7MB in the beginning and 116.6MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.14ms. Allocated memory is still 151.0MB. Free memory was 116.4MB in the beginning and 115.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.13ms. Allocated memory is still 151.0MB. Free memory was 115.0MB in the beginning and 113.7MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 447.55ms. Allocated memory is still 151.0MB. Free memory was 113.7MB in the beginning and 102.4MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 14770.37ms. Allocated memory was 151.0MB in the beginning and 223.3MB in the end (delta: 72.4MB). Free memory was 102.2MB in the beginning and 80.0MB in the end (delta: 22.3MB). Peak memory consumption was 95.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (2 trivial, 11 deterministic, 2 nondeterministic). One deterministic module has affine ranking function 19999 + x * -2 and consists of 2 locations. One deterministic module has affine ranking function 19999 + x * -2 and consists of 2 locations. One deterministic module has affine ranking function 19999 + x * -2 and consists of 2 locations. One deterministic module has affine ranking function 19999 + x * -2 and consists of 2 locations. One deterministic module has affine ranking function 19999 + x * -2 and consists of 2 locations. One deterministic module has affine ranking function 19999 + x * -2 and consists of 2 locations. One deterministic module has affine ranking function 19999 + x * -2 and consists of 2 locations. One deterministic module has affine ranking function 19999 + x * -2 and consists of 2 locations. One deterministic module has affine ranking function 19999 + x * -2 and consists of 2 locations. One deterministic module has affine ranking function 19999 + x * -2 and consists of 3 locations. One deterministic module has affine ranking function 19999 + x * -2 and consists of 3 locations. One nondeterministic module has affine ranking function 19999 + x * -2 and consists of 2 locations. One nondeterministic module has affine ranking function 19999 + x * -2 and consists of 2 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.4s and 14 iterations. TraceHistogramMax:2. Analysis of lassos took 9.4s. Construction of modules took 0.4s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 15. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 223 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [10, 1, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 228 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 210 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 180 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 606 IncrementalHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 0 mSDtfsCounter, 606 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT11 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax323 hnf100 lsp28 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq159 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 13 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.1s InitialAbstractionConstructionTime: 2.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 84 PlacesBefore, 20 PlacesAfterwards, 83 TransitionsBefore, 15 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 82 TotalNumberOfCompositions, 537 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 462, positive: 448, positive conditional: 0, positive unconditional: 448, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 282, positive: 280, positive conditional: 0, positive unconditional: 280, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 462, positive: 168, positive conditional: 0, positive unconditional: 168, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 282, unknown conditional: 0, unknown unconditional: 282] , Statistics on independence cache: Total cache size (in pairs): 17, Positive cache size: 16, Positive conditional cache size: 0, Positive unconditional cache size: 16, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 RESULT: Ultimate proved your program to be correct! [2022-07-22 12:52:09,498 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:52:09,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2022-07-22 12:52:09,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2022-07-22 12:52:10,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...