/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-semanticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:24:17,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:24:17,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:24:17,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:24:17,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:24:17,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:24:17,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:24:17,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:24:17,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:24:17,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:24:17,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:24:17,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:24:17,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:24:17,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:24:17,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:24:17,109 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:24:17,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:24:17,112 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:24:17,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:24:17,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:24:17,128 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:24:17,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:24:17,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:24:17,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:24:17,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:24:17,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:24:17,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:24:17,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:24:17,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:24:17,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:24:17,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:24:17,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:24:17,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:24:17,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:24:17,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:24:17,154 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:24:17,154 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:24:17,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:24:17,156 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:24:17,156 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:24:17,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:24:17,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:24:17,167 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-22 12:24:17,217 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:24:17,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:24:17,218 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:24:17,218 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:24:17,220 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:24:17,220 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:24:17,220 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:24:17,220 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:24:17,221 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:24:17,222 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:24:17,222 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:24:17,222 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:24:17,222 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:24:17,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:24:17,223 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:24:17,223 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:24:17,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:24:17,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:24:17,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:24:17,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:24:17,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:24:17,224 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:24:17,224 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:24:17,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:24:17,224 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:24:17,224 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:24:17,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:24:17,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:24:17,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:24:17,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:24:17,229 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:24:17,232 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:24:17,232 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:24:17,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:24:17,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:24:17,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:24:17,685 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:24:17,685 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:24:17,688 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2022-07-22 12:24:17,759 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20fe63e13/23a5af22639f40838d44622e3903063a/FLAG513dd0c06 [2022-07-22 12:24:18,347 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:24:18,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2022-07-22 12:24:18,355 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20fe63e13/23a5af22639f40838d44622e3903063a/FLAG513dd0c06 [2022-07-22 12:24:18,674 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20fe63e13/23a5af22639f40838d44622e3903063a [2022-07-22 12:24:18,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:24:18,684 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:24:18,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:24:18,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:24:18,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:24:18,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:24:18" (1/1) ... [2022-07-22 12:24:18,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31c2443e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:18, skipping insertion in model container [2022-07-22 12:24:18,695 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:24:18" (1/1) ... [2022-07-22 12:24:18,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:24:18,727 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:24:18,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c[2434,2447] [2022-07-22 12:24:18,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:24:18,948 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:24:18,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c[2434,2447] [2022-07-22 12:24:18,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:24:18,999 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:24:19,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:19 WrapperNode [2022-07-22 12:24:19,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:24:19,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:24:19,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:24:19,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:24:19,011 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:24:19" (1/1) ... [2022-07-22 12:24:19,022 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:24:19" (1/1) ... [2022-07-22 12:24:19,056 INFO L137 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-07-22 12:24:19,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:24:19,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:24:19,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:24:19,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:24:19,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:19" (1/1) ... [2022-07-22 12:24:19,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:19" (1/1) ... [2022-07-22 12:24:19,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:19" (1/1) ... [2022-07-22 12:24:19,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:19" (1/1) ... [2022-07-22 12:24:19,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:19" (1/1) ... [2022-07-22 12:24:19,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:19" (1/1) ... [2022-07-22 12:24:19,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:19" (1/1) ... [2022-07-22 12:24:19,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:24:19,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:24:19,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:24:19,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:24:19,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:19" (1/1) ... [2022-07-22 12:24:19,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:19,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:19,158 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:24:19,168 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:24:19,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:24:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:24:19,219 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:24:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:24:19,220 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:24:19,220 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 12:24:19,220 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 12:24:19,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:24:19,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:24:19,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:24:19,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:24:19,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:24:19,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:24:19,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:24:19,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:24:19,229 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:24:19,336 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:24:19,338 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:24:19,845 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:24:19,858 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:24:19,858 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 12:24:19,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:24:19 BoogieIcfgContainer [2022-07-22 12:24:19,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:24:19,862 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:24:19,863 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:24:19,867 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:24:19,868 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:24:19,868 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:24:18" (1/3) ... [2022-07-22 12:24:19,870 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72ecf69f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:24:19, skipping insertion in model container [2022-07-22 12:24:19,870 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:24:19,870 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:19" (2/3) ... [2022-07-22 12:24:19,870 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72ecf69f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:24:19, skipping insertion in model container [2022-07-22 12:24:19,870 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:24:19,871 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:24:19" (3/3) ... [2022-07-22 12:24:19,872 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2022-07-22 12:24:20,049 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-22 12:24:20,102 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 175 places, 183 transitions, 390 flow [2022-07-22 12:24:20,204 INFO L129 PetriNetUnfolder]: 15/177 cut-off events. [2022-07-22 12:24:20,204 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:24:20,216 INFO L84 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 177 events. 15/177 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 192 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 131. Up to 2 conditions per place. [2022-07-22 12:24:20,216 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 183 transitions, 390 flow [2022-07-22 12:24:20,240 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 177 transitions, 372 flow [2022-07-22 12:24:20,244 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:24:20,264 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 177 transitions, 372 flow [2022-07-22 12:24:20,273 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 177 transitions, 372 flow [2022-07-22 12:24:20,273 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 172 places, 177 transitions, 372 flow [2022-07-22 12:24:20,359 INFO L129 PetriNetUnfolder]: 15/177 cut-off events. [2022-07-22 12:24:20,360 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:24:20,362 INFO L84 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 177 events. 15/177 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 184 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 131. Up to 2 conditions per place. [2022-07-22 12:24:20,367 INFO L116 LiptonReduction]: Number of co-enabled transitions 3534 [2022-07-22 12:24:28,075 INFO L131 LiptonReduction]: Checked pairs total: 4228 [2022-07-22 12:24:28,075 INFO L133 LiptonReduction]: Total number of compositions: 180 [2022-07-22 12:24:28,099 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:24:28,099 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:24:28,099 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:24:28,099 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:24:28,100 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:24:28,100 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:24:28,100 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:24:28,100 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:24:28,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:24:28,197 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 127 [2022-07-22 12:24:28,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:24:28,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:24:28,204 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:24:28,204 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:24:28,204 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:24:28,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 170 states, but on-demand construction may add more states [2022-07-22 12:24:28,221 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 127 [2022-07-22 12:24:28,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:24:28,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:24:28,222 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:24:28,222 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:24:28,228 INFO L748 eck$LassoCheckResult]: Stem: 178#[ULTIMATE.startENTRY]don't care [669] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse0 (store |v_#valid_228| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_65| 1))) (let ((.cse2 (select |v_#memory_int_202| 1)) (.cse3 (store .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_71| 1))) (and (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_71|) (= (select |v_#valid_228| 1) 1) (= v_~sorted2~0_70 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_65|) 0) (= (select |v_#length_189| 2) 25) (= v_~A~0.base_105 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= (select |v_#valid_228| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_71|) 0) (= 48 (select .cse2 0)) (= (select |v_#valid_228| 2) 1) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 0)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_59| 0) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 0) (= v_~sorted3~0_82 0) (= v_~sorted1~0_82 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 0) (= (select |v_#valid_228| 0) 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) 1 0) 0)) (= (store (store (store (store |v_#length_189| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_65| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_71| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|)) |v_#length_188|) (= 2 (select |v_#length_189| 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_54| 4294967296) 1073741823) 1 0)) (= (select .cse2 1) 0) (< 0 |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_63| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_85) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| |v_#StackHeapBarrier_32|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_65|) (= v_~A~0.offset_105 0) (= |v_#valid_227| (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 1)) (= |v_#NULL.offset_16| 0) (= |v_#NULL.base_16| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_228|, #memory_int=|v_#memory_int_202|, #length=|v_#length_189|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_33|, ~A~0.base=v_~A~0.base_105, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_27|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_19|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_63|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_71|, #NULL.offset=|v_#NULL.offset_16|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_49|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, #length=|v_#length_188|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_47|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_29|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_31|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_24|, ~sorted2~0=v_~sorted2~0_70, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_22|, ~N~0=v_~N~0_85, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|, #NULL.base=|v_#NULL.base_16|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_28|, ~sorted3~0=v_~sorted3~0_82, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ~A~0.offset=v_~A~0.offset_105, ~M~0=v_~M~0_51, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_33|, #valid=|v_#valid_227|, #memory_int=|v_#memory_int_202|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_26|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_35|, ~sorted1~0=v_~sorted1~0_82, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_65|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem22#1, ~sorted2~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem23#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sorted3~0, ~A~0.offset, ~M~0, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_main_#t~nondet19#1, ~sorted1~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] 181#[L102-6]don't care [2022-07-22 12:24:28,228 INFO L750 eck$LassoCheckResult]: Loop: 181#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (= (store |v_#memory_int_109| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_109| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|)) |v_#memory_int_108|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_108|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 181#[L102-6]don't care [2022-07-22 12:24:28,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:28,234 INFO L85 PathProgramCache]: Analyzing trace with hash 700, now seen corresponding path program 1 times [2022-07-22 12:24:28,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:28,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490358621] [2022-07-22 12:24:28,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:28,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:28,457 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:28,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:28,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:28,547 INFO L85 PathProgramCache]: Analyzing trace with hash 660, now seen corresponding path program 1 times [2022-07-22 12:24:28,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:28,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132801931] [2022-07-22 12:24:28,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:28,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:28,582 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:28,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:28,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:28,603 INFO L85 PathProgramCache]: Analyzing trace with hash 22329, now seen corresponding path program 1 times [2022-07-22 12:24:28,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:28,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128675257] [2022-07-22 12:24:28,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:28,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:28,662 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:28,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:29,284 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:24:29,285 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:24:29,285 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:24:29,285 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:24:29,285 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:24:29,285 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:29,286 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:24:29,286 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:24:29,286 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sorted.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:24:29,286 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:24:29,286 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:24:29,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:29,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:30,328 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:24:30,333 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:24:30,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:30,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:30,343 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:24:30,347 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:24:30,348 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:24:30,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:30,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:30,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:30,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:30,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:30,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:30,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:30,379 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:30,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 12:24:30,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:30,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:30,427 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:24:30,432 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:24:30,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:30,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:30,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:30,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:30,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:30,448 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:30,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:30,462 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:30,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-22 12:24:30,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:30,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:30,504 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:24:30,508 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:24:30,510 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:24:30,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:30,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:30,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:30,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:30,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:30,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:30,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:30,528 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:30,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-07-22 12:24:30,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:30,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:30,554 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:24:30,556 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:24:30,558 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:24:30,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:30,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:30,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:30,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:30,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:30,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:30,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:30,571 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:30,597 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:24:30,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:30,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:30,600 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:24:30,601 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:24:30,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:30,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:30,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:30,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:30,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:30,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:30,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:30,629 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:30,652 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:24:30,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:30,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:30,654 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:24:30,655 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:24:30,658 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:24:30,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:30,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:30,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:30,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:30,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:30,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:30,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:30,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:30,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:30,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:30,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:30,694 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:24:30,694 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:24:30,695 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:24:30,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:30,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:30,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:30,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:30,704 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:30,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:30,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:30,735 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:24:30,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:30,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:30,737 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:24:30,752 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:24:30,754 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:24:30,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:30,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:30,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:30,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:30,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:30,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:30,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:30,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:30,812 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:24:30,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:30,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:30,814 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:24:30,816 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:24:30,817 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:24:30,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:30,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:30,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:30,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:30,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:30,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:30,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:30,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:30,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-22 12:24:30,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:30,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:30,865 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:24:30,867 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:24:30,867 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:24:30,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:30,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:30,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:30,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:30,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:30,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:30,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:30,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:30,903 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:24:30,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:30,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:30,904 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:24:30,905 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:24:30,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:30,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:30,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:30,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:30,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:30,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:30,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:30,937 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:30,963 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:24:30,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:30,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:30,965 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:24:30,967 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:24:30,967 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:24:30,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:30,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:30,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:30,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:30,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:30,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:30,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:30,976 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:31,001 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:24:31,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:31,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:31,003 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:24:31,010 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:24:31,011 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:24:31,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:31,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:31,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:31,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:31,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:31,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:31,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:31,073 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:24:31,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:31,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:31,075 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:24:31,080 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:24:31,082 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:24:31,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:31,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:31,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:31,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:31,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:31,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:31,107 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:31,142 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:24:31,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:31,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:31,146 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:24:31,167 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:24:31,168 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:24:31,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:31,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:31,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:31,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:31,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:31,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:31,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:31,239 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:24:31,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:31,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:31,241 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:24:31,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:24:31,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:31,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:31,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:31,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:31,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:31,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:31,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:31,258 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:24:31,267 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:31,292 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:24:31,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:31,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:31,294 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:24:31,296 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:24:31,297 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:24:31,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:31,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:31,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:31,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:31,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:31,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:31,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:31,310 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:31,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-07-22 12:24:31,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:31,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:31,337 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:24:31,340 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:24:31,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:31,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:31,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:31,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:31,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:31,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:31,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:31,351 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:24:31,360 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:31,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-07-22 12:24:31,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:31,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:31,391 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:24:31,399 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:24:31,400 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:24:31,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:31,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:31,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:31,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:31,410 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:31,410 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:31,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:31,460 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:24:31,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:31,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:31,461 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:24:31,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:31,471 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:24:31,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:31,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:31,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:31,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:31,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:31,479 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:31,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:31,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:31,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:31,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:31,539 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:24:31,541 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:24:31,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:31,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:31,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:31,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:31,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:31,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:31,558 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:24:31,565 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:31,603 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:24:31,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:31,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:31,604 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:24:31,611 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:24:31,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:31,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:31,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:31,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:31,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:31,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:31,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:31,624 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:24:31,633 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:31,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:31,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:31,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:31,673 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:24:31,676 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:24:31,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:31,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:31,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:31,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:31,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:31,690 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:31,694 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:24:31,701 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:31,732 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:24:31,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:31,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:31,733 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:24:31,734 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:24:31,734 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:24:31,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:31,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:31,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:31,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:31,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:31,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:31,754 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:31,791 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:24:31,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:31,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:31,793 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:24:31,799 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:24:31,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:31,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:31,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:31,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:31,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:31,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:31,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:31,811 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:24:31,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:31,859 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:24:31,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:31,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:31,861 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:24:31,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:31,867 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:24:31,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:31,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:31,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:31,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:31,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:31,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:31,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:31,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:31,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-22 12:24:31,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:31,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:31,923 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:24:31,925 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:24:31,926 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:24:31,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:31,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:31,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:31,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:31,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:31,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:31,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:31,938 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:31,960 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:24:31,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:31,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:31,962 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:24:31,963 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:24:31,964 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:24:31,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:31,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:31,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:31,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:31,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:31,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:31,976 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:32,000 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:24:32,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:32,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:32,002 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:24:32,003 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:24:32,005 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:24:32,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:32,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:32,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:32,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:32,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:32,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:32,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:32,014 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:32,036 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:24:32,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:32,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:32,037 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:24:32,039 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:24:32,040 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:24:32,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:32,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:32,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:32,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:32,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:32,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:32,068 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:32,105 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:24:32,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:32,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:32,107 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:24:32,114 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:24:32,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:32,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:32,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:32,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:32,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:32,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:32,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:32,127 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:24:32,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:32,165 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:24:32,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:32,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:32,166 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:24:32,167 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:24:32,168 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:24:32,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:32,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:32,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:32,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:32,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:32,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:32,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:32,177 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:32,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:32,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:32,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:32,200 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:24:32,201 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:24:32,203 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:24:32,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:32,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:32,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:32,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:32,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:32,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:32,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:32,242 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:24:32,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:32,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:32,243 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:24:32,244 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:24:32,245 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:24:32,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:32,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:32,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:32,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:32,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:32,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:32,258 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:32,281 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:24:32,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:32,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:32,282 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:24:32,284 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:24:32,284 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:24:32,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:32,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:32,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:32,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:32,293 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:32,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:32,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:32,321 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:24:32,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:32,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:32,322 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:24:32,323 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:24:32,325 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:24:32,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:32,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:32,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:32,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:32,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:32,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:32,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:32,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:32,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-22 12:24:32,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:32,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:32,380 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:24:32,382 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:24:32,383 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:24:32,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:32,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:32,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:32,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:32,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:32,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:32,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:32,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:32,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:32,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:32,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:32,420 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:24:32,422 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:24:32,424 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:24:32,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:32,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:32,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:32,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:32,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:32,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:32,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:32,475 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:24:32,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:32,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:32,476 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:24:32,479 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:24:32,480 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:24:32,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:32,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:32,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:32,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:32,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:32,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:32,492 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:32,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:32,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:32,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:32,518 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:24:32,521 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:24:32,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:32,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:32,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:32,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:32,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:32,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:32,535 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:24:32,541 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:32,565 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:24:32,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:32,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:32,567 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:24:32,567 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:24:32,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:32,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:32,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:32,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:32,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:32,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:32,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:32,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:32,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:32,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-22 12:24:32,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:32,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:32,606 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:24:32,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:32,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:32,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:32,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:32,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:32,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:32,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:32,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:32,621 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:24:32,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:32,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-07-22 12:24:32,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:32,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:32,668 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:24:32,674 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:24:32,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:32,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:32,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:32,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:32,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:32,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:32,690 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:24:32,697 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:32,733 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:24:32,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:32,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:32,735 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:24:32,744 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:24:32,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:32,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:32,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:32,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:32,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:32,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:32,759 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:24:32,766 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:32,804 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:24:32,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:32,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:32,806 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:24:32,807 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:24:32,809 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:24:32,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:32,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:32,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:32,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:32,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:32,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:32,831 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:24:32,879 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2022-07-22 12:24:32,879 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. [2022-07-22 12:24:32,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:32,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:32,883 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:24:32,892 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:24:32,901 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:24:32,915 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-22 12:24:32,915 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:24:32,916 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1, ULTIMATE.start_create_fresh_int_array_~i~3#1) = 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 - 2*ULTIMATE.start_create_fresh_int_array_~i~3#1 Supporting invariants [-2*ULTIMATE.start_create_fresh_int_array_~size#1 + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 >= 0] [2022-07-22 12:24:32,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:33,075 INFO L257 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2022-07-22 12:24:33,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:24:33,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:24:33,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:24:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:24:33,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:24:33,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:24:33,174 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:24:33,215 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:24:33,219 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 170 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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:24:33,300 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 170 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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 172 states and 612 transitions. Complement of second has 3 states. [2022-07-22 12:24:33,302 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:24:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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:24:33,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:24:33,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:24:33,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:24:33,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:24:33,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:24:33,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:24:33,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:24:33,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 172 states and 612 transitions. [2022-07-22 12:24:33,322 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 126 [2022-07-22 12:24:33,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 172 states to 164 states and 593 transitions. [2022-07-22 12:24:33,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2022-07-22 12:24:33,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2022-07-22 12:24:33,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 164 states and 593 transitions. [2022-07-22 12:24:33,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:24:33,341 INFO L220 hiAutomatonCegarLoop]: Abstraction has 164 states and 593 transitions. [2022-07-22 12:24:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states and 593 transitions. [2022-07-22 12:24:33,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-07-22 12:24:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 164 states have (on average 3.6158536585365852) internal successors, (593), 163 states have internal predecessors, (593), 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:24:33,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 593 transitions. [2022-07-22 12:24:33,396 INFO L242 hiAutomatonCegarLoop]: Abstraction has 164 states and 593 transitions. [2022-07-22 12:24:33,396 INFO L425 stractBuchiCegarLoop]: Abstraction has 164 states and 593 transitions. [2022-07-22 12:24:33,396 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:24:33,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 164 states and 593 transitions. [2022-07-22 12:24:33,400 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 126 [2022-07-22 12:24:33,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:24:33,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:24:33,401 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:24:33,401 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:24:33,402 INFO L748 eck$LassoCheckResult]: Stem: 1130#[ULTIMATE.startENTRY]don't care [669] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse0 (store |v_#valid_228| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_65| 1))) (let ((.cse2 (select |v_#memory_int_202| 1)) (.cse3 (store .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_71| 1))) (and (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_71|) (= (select |v_#valid_228| 1) 1) (= v_~sorted2~0_70 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_65|) 0) (= (select |v_#length_189| 2) 25) (= v_~A~0.base_105 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= (select |v_#valid_228| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_71|) 0) (= 48 (select .cse2 0)) (= (select |v_#valid_228| 2) 1) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 0)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_59| 0) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 0) (= v_~sorted3~0_82 0) (= v_~sorted1~0_82 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 0) (= (select |v_#valid_228| 0) 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) 1 0) 0)) (= (store (store (store (store |v_#length_189| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_65| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_71| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|)) |v_#length_188|) (= 2 (select |v_#length_189| 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_54| 4294967296) 1073741823) 1 0)) (= (select .cse2 1) 0) (< 0 |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_63| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_85) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| |v_#StackHeapBarrier_32|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_65|) (= v_~A~0.offset_105 0) (= |v_#valid_227| (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 1)) (= |v_#NULL.offset_16| 0) (= |v_#NULL.base_16| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_228|, #memory_int=|v_#memory_int_202|, #length=|v_#length_189|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_33|, ~A~0.base=v_~A~0.base_105, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_27|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_19|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_63|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_71|, #NULL.offset=|v_#NULL.offset_16|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_49|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, #length=|v_#length_188|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_47|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_29|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_31|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_24|, ~sorted2~0=v_~sorted2~0_70, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_22|, ~N~0=v_~N~0_85, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|, #NULL.base=|v_#NULL.base_16|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_28|, ~sorted3~0=v_~sorted3~0_82, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ~A~0.offset=v_~A~0.offset_105, ~M~0=v_~M~0_51, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_33|, #valid=|v_#valid_227|, #memory_int=|v_#memory_int_202|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_26|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_35|, ~sorted1~0=v_~sorted1~0_82, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_65|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem22#1, ~sorted2~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem23#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sorted3~0, ~A~0.offset, ~M~0, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_main_#t~nondet19#1, ~sorted1~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] 1004#[L102-6]don't care [662] L102-6-->L84-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre16#1_41| |v_#pthreadsForks_125|) (= (select |v_#valid_209| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) (= v_~sorted1~0_74 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_95) (= (store |v_#memory_int_189| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_189| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre16#1_41|)) |v_#memory_int_188|) (= v_~sorted3~0_70 1) (= (+ |v_#pthreadsForks_125| 1) |v_#pthreadsForks_124|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= v_~sorted2~0_56 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_172| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_95) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|) (= (ite (and (< v_~M~0_43 v_~N~0_75) (<= 0 v_~M~0_43)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_75, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, #pthreadsForks=|v_#pthreadsForks_125|, ~M~0=v_~M~0_43, #valid=|v_#valid_209|, #memory_int=|v_#memory_int_189|, #length=|v_#length_172|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_27|, ~A~0.base=v_~A~0.base_95, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_75, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ~sorted3~0=v_~sorted3~0_70, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_95, #pthreadsForks=|v_#pthreadsForks_124|, ~M~0=v_~M~0_43, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, #valid=|v_#valid_209|, #memory_int=|v_#memory_int_188|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_41|, #length=|v_#length_172|, ~sorted1~0=v_~sorted1~0_74, ~sorted2~0=v_~sorted2~0_56, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~sorted3~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ~sorted1~0, ~sorted2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1008#[L84-3]don't care [483] L84-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_8|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_8|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_14|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 1096#[L84-4, thread1ENTRY]don't care [421] thread1ENTRY-->L47-5: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 1072#[L84-4, L47-5]don't care [2022-07-22 12:24:33,402 INFO L750 eck$LassoCheckResult]: Loop: 1072#[L84-4, L47-5]don't care [652] L47-5-->L47-5: Formula: (let ((.cse0 (+ v_thread1Thread1of1ForFork1_~i~0_78 1))) (and (= v_thread1Thread1of1ForFork1_~i~0_77 .cse0) (= v_~sorted1~0_64 (ite (= (ite |v_thread1Thread1of1ForFork1_#t~short4_60| 1 0) 0) 0 1)) (= (mod v_~sorted1~0_65 256) 0) (not |v_thread1Thread1of1ForFork1_#t~short4_60|) (< .cse0 v_~N~0_63))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_78, ~N~0=v_~N~0_63, ~sorted1~0=v_~sorted1~0_65} OutVars{thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_55|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_35|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_19|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_59|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_77, ~N~0=v_~N~0_63, ~sorted1~0=v_~sorted1~0_64} AuxVars[|v_thread1Thread1of1ForFork1_#t~short4_60|] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, ~sorted1~0] 1072#[L84-4, L47-5]don't care [2022-07-22 12:24:33,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:33,403 INFO L85 PathProgramCache]: Analyzing trace with hash 21505276, now seen corresponding path program 1 times [2022-07-22 12:24:33,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:33,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649856299] [2022-07-22 12:24:33,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:33,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:24:33,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:24:33,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:24:33,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649856299] [2022-07-22 12:24:33,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649856299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:24:33,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:24:33,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:24:33,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097949721] [2022-07-22 12:24:33,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:24:33,562 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 12:24:33,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:33,562 INFO L85 PathProgramCache]: Analyzing trace with hash 683, now seen corresponding path program 1 times [2022-07-22 12:24:33,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:33,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084491402] [2022-07-22 12:24:33,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:33,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:33,571 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:33,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:33,604 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:24:33,604 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:24:33,604 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:24:33,604 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:24:33,604 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:24:33,604 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:33,605 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:24:33,605 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:24:33,605 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sorted.wvr.c_BEv2_Iteration2_Loop [2022-07-22 12:24:33,605 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:24:33,605 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:24:33,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,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:24:33,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:33,703 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:24:33,764 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:24:33,764 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:24:33,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:33,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:33,768 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:24:33,773 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:24:33,773 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:24:33,784 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:24:33,794 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:24:33,794 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~mem3=0} Honda state: {thread1Thread1of1ForFork1_#t~mem3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:24:33,831 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:24:33,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:33,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:33,833 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:24:33,835 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:24:33,835 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:24:33,845 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:24:33,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:33,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:33,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:33,891 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:24:33,893 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:24:33,893 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:24:33,909 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:24:34,065 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:24:34,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-07-22 12:24:34,068 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:24:34,068 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:24:34,069 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:24:34,069 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:24:34,069 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:24:34,069 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:34,069 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:24:34,069 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:24:34,069 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sorted.wvr.c_BEv2_Iteration2_Loop [2022-07-22 12:24:34,069 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:24:34,069 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:24:34,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:34,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:34,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:34,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:34,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:34,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:34,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:34,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:34,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:34,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:34,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:34,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:34,209 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:24:34,209 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:24:34,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:34,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:34,211 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:24:34,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:34,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:34,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:34,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:34,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:34,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:34,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:34,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:34,234 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:24:34,244 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:24:34,252 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:24:34,252 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:24:34,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:34,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:34,254 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:24:34,256 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:24:34,256 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:24:34,256 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:24:34,256 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, thread1Thread1of1ForFork1_~i~0) = 1*~N~0 - 1*thread1Thread1of1ForFork1_~i~0 Supporting invariants [] [2022-07-22 12:24:34,271 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:24:34,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:34,300 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:24:34,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:24:34,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:24:34,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:24:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:24:34,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:24:34,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:24:34,359 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:24:34,359 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:24:34,360 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 593 transitions. cyclomatic complexity: 492 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:24:34,446 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 593 transitions. cyclomatic complexity: 492. 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 331 states and 1359 transitions. Complement of second has 3 states. [2022-07-22 12:24:34,447 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:24:34,448 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:24:34,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 19 transitions. [2022-07-22 12:24:34,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 19 transitions. Stem has 4 letters. Loop has 1 letters. [2022-07-22 12:24:34,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:24:34,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 19 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:24:34,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:24:34,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 19 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-22 12:24:34,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:24:34,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331 states and 1359 transitions. [2022-07-22 12:24:34,459 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 126 [2022-07-22 12:24:34,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331 states to 331 states and 1359 transitions. [2022-07-22 12:24:34,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 197 [2022-07-22 12:24:34,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 296 [2022-07-22 12:24:34,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 331 states and 1359 transitions. [2022-07-22 12:24:34,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:24:34,478 INFO L220 hiAutomatonCegarLoop]: Abstraction has 331 states and 1359 transitions. [2022-07-22 12:24:34,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states and 1359 transitions. [2022-07-22 12:24:34,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 232. [2022-07-22 12:24:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 232 states have (on average 4.1594827586206895) internal successors, (965), 231 states have internal predecessors, (965), 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:24:34,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 965 transitions. [2022-07-22 12:24:34,504 INFO L242 hiAutomatonCegarLoop]: Abstraction has 232 states and 965 transitions. [2022-07-22 12:24:34,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:24:34,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:24:34,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:24:34,513 INFO L87 Difference]: Start difference. First operand 232 states and 965 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) 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:24:34,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:24:34,576 INFO L93 Difference]: Finished difference Result 232 states and 964 transitions. [2022-07-22 12:24:34,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 964 transitions. [2022-07-22 12:24:34,582 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 126 [2022-07-22 12:24:34,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 232 states and 964 transitions. [2022-07-22 12:24:34,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 197 [2022-07-22 12:24:34,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 197 [2022-07-22 12:24:34,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 232 states and 964 transitions. [2022-07-22 12:24:34,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:24:34,590 INFO L220 hiAutomatonCegarLoop]: Abstraction has 232 states and 964 transitions. [2022-07-22 12:24:34,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states and 964 transitions. [2022-07-22 12:24:34,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2022-07-22 12:24:34,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 232 states have (on average 4.155172413793103) internal successors, (964), 231 states have internal predecessors, (964), 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:24:34,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 964 transitions. [2022-07-22 12:24:34,608 INFO L242 hiAutomatonCegarLoop]: Abstraction has 232 states and 964 transitions. [2022-07-22 12:24:34,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:24:34,609 INFO L425 stractBuchiCegarLoop]: Abstraction has 232 states and 964 transitions. [2022-07-22 12:24:34,610 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:24:34,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 232 states and 964 transitions. [2022-07-22 12:24:34,614 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 126 [2022-07-22 12:24:34,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:24:34,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:24:34,614 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:24:34,614 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:24:34,615 INFO L748 eck$LassoCheckResult]: Stem: 2637#[ULTIMATE.startENTRY]don't care [669] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse0 (store |v_#valid_228| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_65| 1))) (let ((.cse2 (select |v_#memory_int_202| 1)) (.cse3 (store .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_71| 1))) (and (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_71|) (= (select |v_#valid_228| 1) 1) (= v_~sorted2~0_70 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_65|) 0) (= (select |v_#length_189| 2) 25) (= v_~A~0.base_105 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= (select |v_#valid_228| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_71|) 0) (= 48 (select .cse2 0)) (= (select |v_#valid_228| 2) 1) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 0)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_59| 0) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 0) (= v_~sorted3~0_82 0) (= v_~sorted1~0_82 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 0) (= (select |v_#valid_228| 0) 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) 1 0) 0)) (= (store (store (store (store |v_#length_189| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_65| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_71| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|)) |v_#length_188|) (= 2 (select |v_#length_189| 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_54| 4294967296) 1073741823) 1 0)) (= (select .cse2 1) 0) (< 0 |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_63| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_85) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| |v_#StackHeapBarrier_32|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_65|) (= v_~A~0.offset_105 0) (= |v_#valid_227| (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 1)) (= |v_#NULL.offset_16| 0) (= |v_#NULL.base_16| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_228|, #memory_int=|v_#memory_int_202|, #length=|v_#length_189|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_33|, ~A~0.base=v_~A~0.base_105, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_27|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_19|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_63|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_71|, #NULL.offset=|v_#NULL.offset_16|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_49|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, #length=|v_#length_188|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_47|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_29|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_31|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_24|, ~sorted2~0=v_~sorted2~0_70, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_22|, ~N~0=v_~N~0_85, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|, #NULL.base=|v_#NULL.base_16|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_28|, ~sorted3~0=v_~sorted3~0_82, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ~A~0.offset=v_~A~0.offset_105, ~M~0=v_~M~0_51, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_33|, #valid=|v_#valid_227|, #memory_int=|v_#memory_int_202|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_26|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_35|, ~sorted1~0=v_~sorted1~0_82, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_65|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem22#1, ~sorted2~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem23#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sorted3~0, ~A~0.offset, ~M~0, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_main_#t~nondet19#1, ~sorted1~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] 2411#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (= (store |v_#memory_int_109| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_109| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|)) |v_#memory_int_108|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_108|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 2413#[L102-6]don't care [662] L102-6-->L84-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre16#1_41| |v_#pthreadsForks_125|) (= (select |v_#valid_209| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) (= v_~sorted1~0_74 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_95) (= (store |v_#memory_int_189| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_189| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre16#1_41|)) |v_#memory_int_188|) (= v_~sorted3~0_70 1) (= (+ |v_#pthreadsForks_125| 1) |v_#pthreadsForks_124|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= v_~sorted2~0_56 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_172| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_95) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|) (= (ite (and (< v_~M~0_43 v_~N~0_75) (<= 0 v_~M~0_43)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_75, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, #pthreadsForks=|v_#pthreadsForks_125|, ~M~0=v_~M~0_43, #valid=|v_#valid_209|, #memory_int=|v_#memory_int_189|, #length=|v_#length_172|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_27|, ~A~0.base=v_~A~0.base_95, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_75, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ~sorted3~0=v_~sorted3~0_70, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_95, #pthreadsForks=|v_#pthreadsForks_124|, ~M~0=v_~M~0_43, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, #valid=|v_#valid_209|, #memory_int=|v_#memory_int_188|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_41|, #length=|v_#length_172|, ~sorted1~0=v_~sorted1~0_74, ~sorted2~0=v_~sorted2~0_56, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~sorted3~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ~sorted1~0, ~sorted2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2415#[L84-3]don't care [483] L84-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_8|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_8|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_14|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 2541#[L84-4, thread1ENTRY]don't care [421] thread1ENTRY-->L47-5: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 2545#[L84-4, L47-5]don't care [580] L47-5-->L48-3: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork1_~i~0_35 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_33))) (and (<= (+ .cse0 v_~A~0.offset_33 4) (select |v_#length_72| v_~A~0.base_33)) |v_thread1Thread1of1ForFork1_#t~short4_25| (< (+ v_thread1Thread1of1ForFork1_~i~0_35 1) v_~N~0_29) (= (select |v_#valid_89| v_~A~0.base_33) 1) (<= 0 .cse1) (= (select (select |v_#memory_int_64| v_~A~0.base_33) .cse1) |v_thread1Thread1of1ForFork1_#t~mem2_17|) (not (= (mod v_~sorted1~0_24 256) 0))))) InVars {~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_64|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, #length=|v_#length_72|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} OutVars{~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_17|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_25|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_64|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, #length=|v_#length_72|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~short4] 2501#[L84-4, L48-3]don't care [2022-07-22 12:24:34,616 INFO L750 eck$LassoCheckResult]: Loop: 2501#[L84-4, L48-3]don't care [651] L48-3-->L47-5: Formula: (let ((.cse2 (* v_thread1Thread1of1ForFork1_~i~0_74 4))) (let ((.cse1 (+ v_~A~0.offset_79 4 .cse2))) (and (let ((.cse0 (< |v_thread1Thread1of1ForFork1_#t~mem2_52| (select (select |v_#memory_int_170| v_~A~0.base_79) .cse1)))) (or (and (not |v_thread1Thread1of1ForFork1_#t~short4_56|) (not .cse0)) (and |v_thread1Thread1of1ForFork1_#t~short4_56| .cse0))) (= (select |v_#valid_193| v_~A~0.base_79) 1) (= v_~sorted1~0_62 (ite (= (ite |v_thread1Thread1of1ForFork1_#t~short4_56| 1 0) 0) 0 1)) (= v_thread1Thread1of1ForFork1_~i~0_73 (+ v_thread1Thread1of1ForFork1_~i~0_74 1)) (<= 0 .cse1) (<= (+ v_~A~0.offset_79 8 .cse2) (select |v_#length_156| v_~A~0.base_79))))) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_52|, #valid=|v_#valid_193|, #memory_int=|v_#memory_int_170|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_74, #length=|v_#length_156|} OutVars{~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_33|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_55|, #valid=|v_#valid_193|, #memory_int=|v_#memory_int_170|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_73, #length=|v_#length_156|, ~sorted1~0=v_~sorted1~0_62} AuxVars[|v_thread1Thread1of1ForFork1_#t~short4_56|] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, ~sorted1~0] 2499#[L84-4, L47-5]don't care [580] L47-5-->L48-3: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork1_~i~0_35 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_33))) (and (<= (+ .cse0 v_~A~0.offset_33 4) (select |v_#length_72| v_~A~0.base_33)) |v_thread1Thread1of1ForFork1_#t~short4_25| (< (+ v_thread1Thread1of1ForFork1_~i~0_35 1) v_~N~0_29) (= (select |v_#valid_89| v_~A~0.base_33) 1) (<= 0 .cse1) (= (select (select |v_#memory_int_64| v_~A~0.base_33) .cse1) |v_thread1Thread1of1ForFork1_#t~mem2_17|) (not (= (mod v_~sorted1~0_24 256) 0))))) InVars {~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_64|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, #length=|v_#length_72|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} OutVars{~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_17|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_25|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_64|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, #length=|v_#length_72|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~short4] 2501#[L84-4, L48-3]don't care [2022-07-22 12:24:34,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:34,616 INFO L85 PathProgramCache]: Analyzing trace with hash -833336635, now seen corresponding path program 1 times [2022-07-22 12:24:34,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:34,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413526927] [2022-07-22 12:24:34,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:34,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:24:34,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:24:34,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:24:34,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413526927] [2022-07-22 12:24:34,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413526927] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:24:34,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227586289] [2022-07-22 12:24:34,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:34,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:24:34,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:34,701 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 12:24:34,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-07-22 12:24:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:24:34,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 12:24:34,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:24:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:24:34,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:24:34,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:24:34,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227586289] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:24:34,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:24:34,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-07-22 12:24:34,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904925122] [2022-07-22 12:24:34,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:24:34,863 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 12:24:34,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:34,863 INFO L85 PathProgramCache]: Analyzing trace with hash 21722, now seen corresponding path program 1 times [2022-07-22 12:24:34,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:34,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233258099] [2022-07-22 12:24:34,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:34,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:34,873 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:34,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:35,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:24:35,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 12:24:35,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-22 12:24:35,026 INFO L87 Difference]: Start difference. First operand 232 states and 964 transitions. cyclomatic complexity: 829 Second operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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:24:35,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:24:35,260 INFO L93 Difference]: Finished difference Result 393 states and 1482 transitions. [2022-07-22 12:24:35,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 393 states and 1482 transitions. [2022-07-22 12:24:35,269 INFO L131 ngComponentsAnalysis]: Automaton has 110 accepting balls. 204 [2022-07-22 12:24:35,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 393 states to 387 states and 1465 transitions. [2022-07-22 12:24:35,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 351 [2022-07-22 12:24:35,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 351 [2022-07-22 12:24:35,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 387 states and 1465 transitions. [2022-07-22 12:24:35,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:24:35,281 INFO L220 hiAutomatonCegarLoop]: Abstraction has 387 states and 1465 transitions. [2022-07-22 12:24:35,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states and 1465 transitions. [2022-07-22 12:24:35,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 298. [2022-07-22 12:24:35,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 298 states have (on average 4.003355704697986) internal successors, (1193), 297 states have internal predecessors, (1193), 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:24:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 1193 transitions. [2022-07-22 12:24:35,300 INFO L242 hiAutomatonCegarLoop]: Abstraction has 298 states and 1193 transitions. [2022-07-22 12:24:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 12:24:35,301 INFO L425 stractBuchiCegarLoop]: Abstraction has 298 states and 1193 transitions. [2022-07-22 12:24:35,301 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:24:35,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 298 states and 1193 transitions. [2022-07-22 12:24:35,306 INFO L131 ngComponentsAnalysis]: Automaton has 86 accepting balls. 166 [2022-07-22 12:24:35,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:24:35,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:24:35,307 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2022-07-22 12:24:35,307 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:24:35,308 INFO L748 eck$LassoCheckResult]: Stem: 3553#[ULTIMATE.startENTRY]don't care [669] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse0 (store |v_#valid_228| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_65| 1))) (let ((.cse2 (select |v_#memory_int_202| 1)) (.cse3 (store .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_71| 1))) (and (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_71|) (= (select |v_#valid_228| 1) 1) (= v_~sorted2~0_70 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_65|) 0) (= (select |v_#length_189| 2) 25) (= v_~A~0.base_105 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= (select |v_#valid_228| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_71|) 0) (= 48 (select .cse2 0)) (= (select |v_#valid_228| 2) 1) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 0)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_59| 0) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 0) (= v_~sorted3~0_82 0) (= v_~sorted1~0_82 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 0) (= (select |v_#valid_228| 0) 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) 1 0) 0)) (= (store (store (store (store |v_#length_189| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_65| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_71| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|)) |v_#length_188|) (= 2 (select |v_#length_189| 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_54| 4294967296) 1073741823) 1 0)) (= (select .cse2 1) 0) (< 0 |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_63| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_85) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| |v_#StackHeapBarrier_32|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_65|) (= v_~A~0.offset_105 0) (= |v_#valid_227| (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 1)) (= |v_#NULL.offset_16| 0) (= |v_#NULL.base_16| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_228|, #memory_int=|v_#memory_int_202|, #length=|v_#length_189|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_33|, ~A~0.base=v_~A~0.base_105, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_27|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_19|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_63|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_71|, #NULL.offset=|v_#NULL.offset_16|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_49|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, #length=|v_#length_188|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_47|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_29|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_31|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_24|, ~sorted2~0=v_~sorted2~0_70, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_22|, ~N~0=v_~N~0_85, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|, #NULL.base=|v_#NULL.base_16|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_28|, ~sorted3~0=v_~sorted3~0_82, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ~A~0.offset=v_~A~0.offset_105, ~M~0=v_~M~0_51, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_33|, #valid=|v_#valid_227|, #memory_int=|v_#memory_int_202|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_26|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_35|, ~sorted1~0=v_~sorted1~0_82, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_65|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem22#1, ~sorted2~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem23#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sorted3~0, ~A~0.offset, ~M~0, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_main_#t~nondet19#1, ~sorted1~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] 3341#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (= (store |v_#memory_int_109| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_109| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|)) |v_#memory_int_108|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_108|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 3343#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (= (store |v_#memory_int_109| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_109| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|)) |v_#memory_int_108|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_108|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 3345#[L102-6]don't care [662] L102-6-->L84-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre16#1_41| |v_#pthreadsForks_125|) (= (select |v_#valid_209| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) (= v_~sorted1~0_74 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_95) (= (store |v_#memory_int_189| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_189| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre16#1_41|)) |v_#memory_int_188|) (= v_~sorted3~0_70 1) (= (+ |v_#pthreadsForks_125| 1) |v_#pthreadsForks_124|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= v_~sorted2~0_56 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_172| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_95) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|) (= (ite (and (< v_~M~0_43 v_~N~0_75) (<= 0 v_~M~0_43)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_75, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, #pthreadsForks=|v_#pthreadsForks_125|, ~M~0=v_~M~0_43, #valid=|v_#valid_209|, #memory_int=|v_#memory_int_189|, #length=|v_#length_172|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_27|, ~A~0.base=v_~A~0.base_95, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_75, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ~sorted3~0=v_~sorted3~0_70, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_95, #pthreadsForks=|v_#pthreadsForks_124|, ~M~0=v_~M~0_43, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, #valid=|v_#valid_209|, #memory_int=|v_#memory_int_188|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_41|, #length=|v_#length_172|, ~sorted1~0=v_~sorted1~0_74, ~sorted2~0=v_~sorted2~0_56, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~sorted3~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ~sorted1~0, ~sorted2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3593#[L84-3]don't care [483] L84-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_8|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_8|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_14|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 3585#[L84-4, thread1ENTRY]don't care [421] thread1ENTRY-->L47-5: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 3587#[L84-4, L47-5]don't care [580] L47-5-->L48-3: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork1_~i~0_35 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_33))) (and (<= (+ .cse0 v_~A~0.offset_33 4) (select |v_#length_72| v_~A~0.base_33)) |v_thread1Thread1of1ForFork1_#t~short4_25| (< (+ v_thread1Thread1of1ForFork1_~i~0_35 1) v_~N~0_29) (= (select |v_#valid_89| v_~A~0.base_33) 1) (<= 0 .cse1) (= (select (select |v_#memory_int_64| v_~A~0.base_33) .cse1) |v_thread1Thread1of1ForFork1_#t~mem2_17|) (not (= (mod v_~sorted1~0_24 256) 0))))) InVars {~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_64|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, #length=|v_#length_72|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} OutVars{~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_17|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_25|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_64|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, #length=|v_#length_72|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~short4] 3445#[L84-4, L48-3]don't care [2022-07-22 12:24:35,308 INFO L750 eck$LassoCheckResult]: Loop: 3445#[L84-4, L48-3]don't care [651] L48-3-->L47-5: Formula: (let ((.cse2 (* v_thread1Thread1of1ForFork1_~i~0_74 4))) (let ((.cse1 (+ v_~A~0.offset_79 4 .cse2))) (and (let ((.cse0 (< |v_thread1Thread1of1ForFork1_#t~mem2_52| (select (select |v_#memory_int_170| v_~A~0.base_79) .cse1)))) (or (and (not |v_thread1Thread1of1ForFork1_#t~short4_56|) (not .cse0)) (and |v_thread1Thread1of1ForFork1_#t~short4_56| .cse0))) (= (select |v_#valid_193| v_~A~0.base_79) 1) (= v_~sorted1~0_62 (ite (= (ite |v_thread1Thread1of1ForFork1_#t~short4_56| 1 0) 0) 0 1)) (= v_thread1Thread1of1ForFork1_~i~0_73 (+ v_thread1Thread1of1ForFork1_~i~0_74 1)) (<= 0 .cse1) (<= (+ v_~A~0.offset_79 8 .cse2) (select |v_#length_156| v_~A~0.base_79))))) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_52|, #valid=|v_#valid_193|, #memory_int=|v_#memory_int_170|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_74, #length=|v_#length_156|} OutVars{~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_33|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_55|, #valid=|v_#valid_193|, #memory_int=|v_#memory_int_170|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_73, #length=|v_#length_156|, ~sorted1~0=v_~sorted1~0_62} AuxVars[|v_thread1Thread1of1ForFork1_#t~short4_56|] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, ~sorted1~0] 3539#[L84-4, L47-5]don't care [580] L47-5-->L48-3: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork1_~i~0_35 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_33))) (and (<= (+ .cse0 v_~A~0.offset_33 4) (select |v_#length_72| v_~A~0.base_33)) |v_thread1Thread1of1ForFork1_#t~short4_25| (< (+ v_thread1Thread1of1ForFork1_~i~0_35 1) v_~N~0_29) (= (select |v_#valid_89| v_~A~0.base_33) 1) (<= 0 .cse1) (= (select (select |v_#memory_int_64| v_~A~0.base_33) .cse1) |v_thread1Thread1of1ForFork1_#t~mem2_17|) (not (= (mod v_~sorted1~0_24 256) 0))))) InVars {~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_64|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, #length=|v_#length_72|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} OutVars{~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_17|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_25|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_64|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, #length=|v_#length_72|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~short4] 3445#[L84-4, L48-3]don't care [2022-07-22 12:24:35,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:35,309 INFO L85 PathProgramCache]: Analyzing trace with hash -88720280, now seen corresponding path program 2 times [2022-07-22 12:24:35,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:35,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148569308] [2022-07-22 12:24:35,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:35,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:35,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:35,428 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:35,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:35,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:35,469 INFO L85 PathProgramCache]: Analyzing trace with hash 21722, now seen corresponding path program 2 times [2022-07-22 12:24:35,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:35,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44016094] [2022-07-22 12:24:35,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:35,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:35,478 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:35,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:35,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:35,496 INFO L85 PathProgramCache]: Analyzing trace with hash 639177601, now seen corresponding path program 1 times [2022-07-22 12:24:35,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:35,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739516332] [2022-07-22 12:24:35,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:35,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:24:35,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:24:35,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:24:35,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739516332] [2022-07-22 12:24:35,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739516332] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:24:35,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568121149] [2022-07-22 12:24:35,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:35,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:24:35,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:35,657 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 12:24:35,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-07-22 12:24:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:24:35,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 12:24:35,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:24:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:24:35,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:24:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:24:35,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568121149] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:24:35,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:24:35,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-07-22 12:24:35,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730558238] [2022-07-22 12:24:35,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:24:36,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:24:36,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 12:24:36,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-22 12:24:36,030 INFO L87 Difference]: Start difference. First operand 298 states and 1193 transitions. cyclomatic complexity: 1016 Second operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 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:24:36,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:24:36,538 INFO L93 Difference]: Finished difference Result 677 states and 2523 transitions. [2022-07-22 12:24:36,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 677 states and 2523 transitions. [2022-07-22 12:24:36,552 INFO L131 ngComponentsAnalysis]: Automaton has 206 accepting balls. 360 [2022-07-22 12:24:36,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 677 states to 665 states and 2481 transitions. [2022-07-22 12:24:36,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 596 [2022-07-22 12:24:36,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 628 [2022-07-22 12:24:36,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 665 states and 2481 transitions. [2022-07-22 12:24:36,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:24:36,570 INFO L220 hiAutomatonCegarLoop]: Abstraction has 665 states and 2481 transitions. [2022-07-22 12:24:36,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states and 2481 transitions. [2022-07-22 12:24:36,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 396. [2022-07-22 12:24:36,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 396 states have (on average 4.037878787878788) internal successors, (1599), 395 states have internal predecessors, (1599), 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:24:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1599 transitions. [2022-07-22 12:24:36,594 INFO L242 hiAutomatonCegarLoop]: Abstraction has 396 states and 1599 transitions. [2022-07-22 12:24:36,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 12:24:36,595 INFO L425 stractBuchiCegarLoop]: Abstraction has 396 states and 1599 transitions. [2022-07-22 12:24:36,595 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:24:36,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 396 states and 1599 transitions. [2022-07-22 12:24:36,601 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 226 [2022-07-22 12:24:36,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:24:36,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:24:36,602 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:24:36,602 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:24:36,603 INFO L748 eck$LassoCheckResult]: Stem: 4984#[ULTIMATE.startENTRY]don't care [669] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse0 (store |v_#valid_228| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_65| 1))) (let ((.cse2 (select |v_#memory_int_202| 1)) (.cse3 (store .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_71| 1))) (and (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_71|) (= (select |v_#valid_228| 1) 1) (= v_~sorted2~0_70 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_65|) 0) (= (select |v_#length_189| 2) 25) (= v_~A~0.base_105 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= (select |v_#valid_228| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_71|) 0) (= 48 (select .cse2 0)) (= (select |v_#valid_228| 2) 1) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 0)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_59| 0) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 0) (= v_~sorted3~0_82 0) (= v_~sorted1~0_82 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 0) (= (select |v_#valid_228| 0) 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) 1 0) 0)) (= (store (store (store (store |v_#length_189| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_65| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_71| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|)) |v_#length_188|) (= 2 (select |v_#length_189| 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_54| 4294967296) 1073741823) 1 0)) (= (select .cse2 1) 0) (< 0 |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_63| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_85) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| |v_#StackHeapBarrier_32|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_65|) (= v_~A~0.offset_105 0) (= |v_#valid_227| (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 1)) (= |v_#NULL.offset_16| 0) (= |v_#NULL.base_16| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_228|, #memory_int=|v_#memory_int_202|, #length=|v_#length_189|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_33|, ~A~0.base=v_~A~0.base_105, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_27|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_19|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_63|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_71|, #NULL.offset=|v_#NULL.offset_16|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_49|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, #length=|v_#length_188|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_47|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_29|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_31|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_24|, ~sorted2~0=v_~sorted2~0_70, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_22|, ~N~0=v_~N~0_85, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|, #NULL.base=|v_#NULL.base_16|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_28|, ~sorted3~0=v_~sorted3~0_82, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ~A~0.offset=v_~A~0.offset_105, ~M~0=v_~M~0_51, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_33|, #valid=|v_#valid_227|, #memory_int=|v_#memory_int_202|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_26|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_35|, ~sorted1~0=v_~sorted1~0_82, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_65|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem22#1, ~sorted2~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem23#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sorted3~0, ~A~0.offset, ~M~0, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_main_#t~nondet19#1, ~sorted1~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] 4702#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (= (store |v_#memory_int_109| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_109| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|)) |v_#memory_int_108|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_108|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 4704#[L102-6]don't care [662] L102-6-->L84-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre16#1_41| |v_#pthreadsForks_125|) (= (select |v_#valid_209| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) (= v_~sorted1~0_74 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_95) (= (store |v_#memory_int_189| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_189| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre16#1_41|)) |v_#memory_int_188|) (= v_~sorted3~0_70 1) (= (+ |v_#pthreadsForks_125| 1) |v_#pthreadsForks_124|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= v_~sorted2~0_56 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_172| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_95) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|) (= (ite (and (< v_~M~0_43 v_~N~0_75) (<= 0 v_~M~0_43)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_75, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, #pthreadsForks=|v_#pthreadsForks_125|, ~M~0=v_~M~0_43, #valid=|v_#valid_209|, #memory_int=|v_#memory_int_189|, #length=|v_#length_172|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_27|, ~A~0.base=v_~A~0.base_95, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_75, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ~sorted3~0=v_~sorted3~0_70, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_95, #pthreadsForks=|v_#pthreadsForks_124|, ~M~0=v_~M~0_43, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, #valid=|v_#valid_209|, #memory_int=|v_#memory_int_188|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_41|, #length=|v_#length_172|, ~sorted1~0=v_~sorted1~0_74, ~sorted2~0=v_~sorted2~0_56, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~sorted3~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ~sorted1~0, ~sorted2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4708#[L84-3]don't care [483] L84-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_8|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_8|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_14|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 4866#[L84-4, thread1ENTRY]don't care [613] L84-4-->L85-3: Formula: (and (= |v_#pthreadsForks_44| (+ |v_#pthreadsForks_45| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_45|) (= (select |v_#valid_125| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_96| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= |v_#memory_int_84| (store |v_#memory_int_85| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_85| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre18#1_19|)))) InVars {#pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_125|, #memory_int=|v_#memory_int_85|, #length=|v_#length_96|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_44|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_125|, #memory_int=|v_#memory_int_84|, #length=|v_#length_96|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_9|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] 4868#[L85-3, thread1ENTRY]don't care [486] L85-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_2) (= 0 v_thread2Thread1of1ForFork2_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre18#1_6| v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_8|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_2, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_8|, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_16, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_4|, thread2Thread1of1ForFork2_#t~short8=|v_thread2Thread1of1ForFork2_#t~short8_14|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_#t~post5=|v_thread2Thread1of1ForFork2_#t~post5_8|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_thidvar2, thread2Thread1of1ForFork2_#t~mem7, thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#t~short8, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_#t~post5, thread2Thread1of1ForFork2_#res.offset] 4656#[L85-4, thread2ENTRY, thread1ENTRY]don't care [440] thread2ENTRY-->L55-5: Formula: (= v_thread2Thread1of1ForFork2_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1] 4662#[L55-5, L85-4, thread1ENTRY]don't care [2022-07-22 12:24:36,603 INFO L750 eck$LassoCheckResult]: Loop: 4662#[L55-5, L85-4, thread1ENTRY]don't care [664] L55-5-->L55-5: Formula: (and (= v_~sorted2~0_60 (ite (= (ite |v_thread2Thread1of1ForFork2_#t~short8_48| 1 0) 0) 0 1)) (= (+ v_thread2Thread1of1ForFork2_~i~1_64 1) v_thread2Thread1of1ForFork2_~i~1_63) (= 0 (mod v_~sorted2~0_61 256)) (not |v_thread2Thread1of1ForFork2_#t~short8_48|) (< v_thread2Thread1of1ForFork2_~i~1_64 v_~M~0_45)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_64, ~M~0=v_~M~0_45, ~sorted2~0=v_~sorted2~0_61} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_45|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_35|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_63, ~M~0=v_~M~0_45, thread2Thread1of1ForFork2_#t~short8=|v_thread2Thread1of1ForFork2_#t~short8_47|, thread2Thread1of1ForFork2_#t~post5=|v_thread2Thread1of1ForFork2_#t~post5_21|, ~sorted2~0=v_~sorted2~0_60} AuxVars[|v_thread2Thread1of1ForFork2_#t~short8_48|] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_#t~mem7, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~short8, thread2Thread1of1ForFork2_#t~post5, ~sorted2~0] 4662#[L55-5, L85-4, thread1ENTRY]don't care [2022-07-22 12:24:36,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:36,604 INFO L85 PathProgramCache]: Analyzing trace with hash -63449871, now seen corresponding path program 1 times [2022-07-22 12:24:36,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:36,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421611731] [2022-07-22 12:24:36,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:36,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:36,646 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:36,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:36,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:36,677 INFO L85 PathProgramCache]: Analyzing trace with hash 695, now seen corresponding path program 1 times [2022-07-22 12:24:36,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:36,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338170905] [2022-07-22 12:24:36,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:36,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:36,682 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:36,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:36,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:36,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1966945337, now seen corresponding path program 1 times [2022-07-22 12:24:36,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:36,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397200523] [2022-07-22 12:24:36,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:36,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:24:36,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:24:36,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:24:36,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397200523] [2022-07-22 12:24:36,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397200523] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:24:36,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:24:36,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:24:36,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982401946] [2022-07-22 12:24:36,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:24:36,749 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:24:36,749 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:24:36,749 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:24:36,749 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:24:36,749 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:24:36,749 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:36,749 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:24:36,749 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:24:36,749 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sorted.wvr.c_BEv2_Iteration5_Loop [2022-07-22 12:24:36,750 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:24:36,750 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:24:36,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:24:36,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:24:36,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:36,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:36,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:36,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:36,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:36,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:36,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:36,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:24:36,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:36,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:36,870 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:24:36,870 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:24:36,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:36,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:36,873 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:24:36,881 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:24:36,881 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:24:36,894 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:24:36,897 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:24:36,897 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_4=-1} Honda state: {v_rep#funAddr~thread1.base_4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:24:36,920 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:24:36,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:36,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:36,921 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:24:36,922 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:24:36,922 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:24:36,923 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:24:36,935 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:24:36,936 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread3.base_4=-1} Honda state: {v_rep#funAddr~thread3.base_4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:24:36,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:36,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:36,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:36,959 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:24:36,966 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:24:36,966 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:24:36,982 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:24:36,985 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:24:36,985 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_4=-1} Honda state: {v_rep#funAddr~thread2.base_4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:24:37,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:37,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:37,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:37,013 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:24:37,014 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:24:37,015 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:24:37,015 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:24:37,024 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:24:37,024 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork2_#t~mem6=0} Honda state: {thread2Thread1of1ForFork2_#t~mem6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:24:37,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-07-22 12:24:37,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:37,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:37,048 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:24:37,048 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:24:37,049 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:24:37,049 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:24:37,057 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:24:37,057 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork2_#t~mem7=0} Honda state: {thread2Thread1of1ForFork2_#t~mem7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:24:37,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-07-22 12:24:37,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:37,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:37,081 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:24:37,082 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:24:37,083 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:24:37,083 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:24:37,096 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:24:37,096 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_4=0} Honda state: {v_rep#funAddr~thread1.offset_4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:24:37,123 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:24:37,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:37,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:37,125 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:24:37,126 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:24:37,126 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:24:37,126 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:24:37,134 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:24:37,134 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite thread2Thread1of1ForFork2_#t~short8 1 0)_1=0} Honda state: {v_rep(ite thread2Thread1of1ForFork2_#t~short8 1 0)_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:24:37,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-07-22 12:24:37,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:37,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:37,159 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:24:37,159 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:24:37,160 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:24:37,160 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:24:37,173 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:24:37,173 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_4=1} Honda state: {v_rep#funAddr~thread2.offset_4=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:24:37,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-07-22 12:24:37,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:37,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:37,197 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:24:37,198 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:24:37,202 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:24:37,202 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:24:37,215 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:24:37,215 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~sorted2~0=0} Honda state: {~sorted2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:24:37,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-07-22 12:24:37,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:37,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:37,239 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:24:37,240 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:24:37,240 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:24:37,240 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:24:37,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-07-22 12:24:37,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:37,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:37,271 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:24:37,288 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:24:37,295 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:24:37,295 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:24:37,467 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:24:37,470 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:24:37,470 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:24:37,471 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:24:37,471 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:24:37,471 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:24:37,471 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:24:37,471 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:37,471 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:24:37,471 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:24:37,471 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sorted.wvr.c_BEv2_Iteration5_Loop [2022-07-22 12:24:37,471 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:24:37,471 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:24:37,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:37,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:37,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:37,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:37,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:37,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:37,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:37,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:37,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:37,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:37,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:24:37,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:37,637 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:24:37,638 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:24:37,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:37,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:37,639 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:24:37,646 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:24:37,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:37,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:37,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:37,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:37,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:37,656 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:37,656 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:37,657 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:24:37,667 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:37,701 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:24:37,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:37,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:37,702 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:24:37,703 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:24:37,703 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:24:37,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:37,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:37,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:37,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:37,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:37,711 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:37,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:37,737 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:24:37,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:37,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:37,739 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:24:37,744 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:24:37,747 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:24:37,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:37,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:37,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:37,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:37,752 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:37,753 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:37,777 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:37,809 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:24:37,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:37,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:37,811 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:24:37,812 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:24:37,812 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:24:37,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:37,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:37,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:37,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:37,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:37,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:37,824 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:37,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-07-22 12:24:37,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:37,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:37,847 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:24:37,851 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:24:37,852 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:24:37,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:37,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:37,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:37,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:37,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:37,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:37,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:37,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:37,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-07-22 12:24:37,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:37,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:37,884 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:24:37,885 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:24:37,885 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:24:37,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:37,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:37,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:37,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:37,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:37,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:37,897 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:37,920 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:24:37,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:37,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:37,921 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:24:37,921 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:24:37,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:37,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:37,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:37,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:37,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:37,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:37,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:37,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:37,930 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:37,952 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:24:37,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:37,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:37,954 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:24:37,954 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:24:37,955 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:24:37,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:37,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:37,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:37,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:37,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:37,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:37,966 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:37,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-07-22 12:24:37,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:37,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:37,989 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:24:37,989 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:24:37,990 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:24:37,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:37,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:37,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:37,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:37,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:37,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:37,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:38,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:38,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:38,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:38,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:38,023 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:24:38,024 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:24:38,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:24:38,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:38,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:38,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:38,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:38,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:38,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:38,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:38,037 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:24:38,040 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:24:38,040 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:24:38,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:38,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:38,042 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:24:38,043 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:24:38,043 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:24:38,043 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:24:38,043 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:24:38,044 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork2_~i~1, ~M~0) = -1*thread2Thread1of1ForFork2_~i~1 + 1*~M~0 Supporting invariants [] [2022-07-22 12:24:38,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2022-07-22 12:24:38,066 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:24:38,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:24:38,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:24:38,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:24:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:24:38,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:24:38,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:24:38,131 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:24:38,131 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:24:38,131 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 396 states and 1599 transitions. cyclomatic complexity: 1360 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:24:38,222 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 396 states and 1599 transitions. cyclomatic complexity: 1360. 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 777 states and 3380 transitions. Complement of second has 3 states. [2022-07-22 12:24:38,222 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:24:38,224 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:24:38,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2022-07-22 12:24:38,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 21 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:24:38,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:24:38,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 21 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:24:38,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:24:38,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 21 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:24:38,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:24:38,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 777 states and 3380 transitions. [2022-07-22 12:24:38,243 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 226 [2022-07-22 12:24:38,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 777 states to 777 states and 3380 transitions. [2022-07-22 12:24:38,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 437 [2022-07-22 12:24:38,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 654 [2022-07-22 12:24:38,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 777 states and 3380 transitions. [2022-07-22 12:24:38,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:24:38,264 INFO L220 hiAutomatonCegarLoop]: Abstraction has 777 states and 3380 transitions. [2022-07-22 12:24:38,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states and 3380 transitions. [2022-07-22 12:24:38,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 552. [2022-07-22 12:24:38,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 552 states have (on average 4.443840579710145) internal successors, (2453), 551 states have internal predecessors, (2453), 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:24:38,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 2453 transitions. [2022-07-22 12:24:38,291 INFO L242 hiAutomatonCegarLoop]: Abstraction has 552 states and 2453 transitions. [2022-07-22 12:24:38,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:24:38,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:24:38,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:24:38,292 INFO L87 Difference]: Start difference. First operand 552 states and 2453 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:24:38,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:24:38,364 INFO L93 Difference]: Finished difference Result 742 states and 2995 transitions. [2022-07-22 12:24:38,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 742 states and 2995 transitions. [2022-07-22 12:24:38,379 INFO L131 ngComponentsAnalysis]: Automaton has 196 accepting balls. 324 [2022-07-22 12:24:38,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 742 states to 742 states and 2995 transitions. [2022-07-22 12:24:38,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 681 [2022-07-22 12:24:38,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 681 [2022-07-22 12:24:38,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 742 states and 2995 transitions. [2022-07-22 12:24:38,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:24:38,397 INFO L220 hiAutomatonCegarLoop]: Abstraction has 742 states and 2995 transitions. [2022-07-22 12:24:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states and 2995 transitions. [2022-07-22 12:24:38,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 496. [2022-07-22 12:24:38,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 496 states have (on average 4.183467741935484) internal successors, (2075), 495 states have internal predecessors, (2075), 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:24:38,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 2075 transitions. [2022-07-22 12:24:38,423 INFO L242 hiAutomatonCegarLoop]: Abstraction has 496 states and 2075 transitions. [2022-07-22 12:24:38,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:24:38,425 INFO L425 stractBuchiCegarLoop]: Abstraction has 496 states and 2075 transitions. [2022-07-22 12:24:38,425 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:24:38,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 496 states and 2075 transitions. [2022-07-22 12:24:38,433 INFO L131 ngComponentsAnalysis]: Automaton has 146 accepting balls. 258 [2022-07-22 12:24:38,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:24:38,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:24:38,433 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1] [2022-07-22 12:24:38,434 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:24:38,438 INFO L748 eck$LassoCheckResult]: Stem: 8538#[ULTIMATE.startENTRY]don't care [669] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse0 (store |v_#valid_228| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_65| 1))) (let ((.cse2 (select |v_#memory_int_202| 1)) (.cse3 (store .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_71| 1))) (and (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_71|) (= (select |v_#valid_228| 1) 1) (= v_~sorted2~0_70 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_65|) 0) (= (select |v_#length_189| 2) 25) (= v_~A~0.base_105 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= (select |v_#valid_228| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_71|) 0) (= 48 (select .cse2 0)) (= (select |v_#valid_228| 2) 1) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 0)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_59| 0) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 0) (= v_~sorted3~0_82 0) (= v_~sorted1~0_82 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 0) (= (select |v_#valid_228| 0) 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) 1 0) 0)) (= (store (store (store (store |v_#length_189| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_65| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_71| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|)) |v_#length_188|) (= 2 (select |v_#length_189| 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_54| 4294967296) 1073741823) 1 0)) (= (select .cse2 1) 0) (< 0 |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_63| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_85) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| |v_#StackHeapBarrier_32|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_65|) (= v_~A~0.offset_105 0) (= |v_#valid_227| (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 1)) (= |v_#NULL.offset_16| 0) (= |v_#NULL.base_16| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_228|, #memory_int=|v_#memory_int_202|, #length=|v_#length_189|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_33|, ~A~0.base=v_~A~0.base_105, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_27|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_19|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_63|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_71|, #NULL.offset=|v_#NULL.offset_16|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_49|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, #length=|v_#length_188|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_47|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_29|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_31|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_24|, ~sorted2~0=v_~sorted2~0_70, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_22|, ~N~0=v_~N~0_85, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|, #NULL.base=|v_#NULL.base_16|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_28|, ~sorted3~0=v_~sorted3~0_82, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ~A~0.offset=v_~A~0.offset_105, ~M~0=v_~M~0_51, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_33|, #valid=|v_#valid_227|, #memory_int=|v_#memory_int_202|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_26|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_35|, ~sorted1~0=v_~sorted1~0_82, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_65|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem22#1, ~sorted2~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem23#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sorted3~0, ~A~0.offset, ~M~0, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_main_#t~nondet19#1, ~sorted1~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] 8166#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (= (store |v_#memory_int_109| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_109| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|)) |v_#memory_int_108|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_108|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 8168#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (= (store |v_#memory_int_109| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_109| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|)) |v_#memory_int_108|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_108|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 8170#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (= (store |v_#memory_int_109| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_109| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|)) |v_#memory_int_108|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_116| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_108|, #length=|v_#length_116|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 8614#[L102-6]don't care [662] L102-6-->L84-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre16#1_41| |v_#pthreadsForks_125|) (= (select |v_#valid_209| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) (= v_~sorted1~0_74 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_95) (= (store |v_#memory_int_189| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_189| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre16#1_41|)) |v_#memory_int_188|) (= v_~sorted3~0_70 1) (= (+ |v_#pthreadsForks_125| 1) |v_#pthreadsForks_124|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= v_~sorted2~0_56 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_172| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_95) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|) (= (ite (and (< v_~M~0_43 v_~N~0_75) (<= 0 v_~M~0_43)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_75, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, #pthreadsForks=|v_#pthreadsForks_125|, ~M~0=v_~M~0_43, #valid=|v_#valid_209|, #memory_int=|v_#memory_int_189|, #length=|v_#length_172|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_27|, ~A~0.base=v_~A~0.base_95, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_75, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ~sorted3~0=v_~sorted3~0_70, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_95, #pthreadsForks=|v_#pthreadsForks_124|, ~M~0=v_~M~0_43, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, #valid=|v_#valid_209|, #memory_int=|v_#memory_int_188|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_41|, #length=|v_#length_172|, ~sorted1~0=v_~sorted1~0_74, ~sorted2~0=v_~sorted2~0_56, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~sorted3~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ~sorted1~0, ~sorted2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 8612#[L84-3]don't care [483] L84-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_8|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_8|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_14|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 8566#[L84-4, thread1ENTRY]don't care [421] thread1ENTRY-->L47-5: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 8564#[L84-4, L47-5]don't care [580] L47-5-->L48-3: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork1_~i~0_35 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_33))) (and (<= (+ .cse0 v_~A~0.offset_33 4) (select |v_#length_72| v_~A~0.base_33)) |v_thread1Thread1of1ForFork1_#t~short4_25| (< (+ v_thread1Thread1of1ForFork1_~i~0_35 1) v_~N~0_29) (= (select |v_#valid_89| v_~A~0.base_33) 1) (<= 0 .cse1) (= (select (select |v_#memory_int_64| v_~A~0.base_33) .cse1) |v_thread1Thread1of1ForFork1_#t~mem2_17|) (not (= (mod v_~sorted1~0_24 256) 0))))) InVars {~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_64|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, #length=|v_#length_72|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} OutVars{~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_17|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_25|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_64|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, #length=|v_#length_72|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~short4] 8318#[L84-4, L48-3]don't care [2022-07-22 12:24:38,438 INFO L750 eck$LassoCheckResult]: Loop: 8318#[L84-4, L48-3]don't care [651] L48-3-->L47-5: Formula: (let ((.cse2 (* v_thread1Thread1of1ForFork1_~i~0_74 4))) (let ((.cse1 (+ v_~A~0.offset_79 4 .cse2))) (and (let ((.cse0 (< |v_thread1Thread1of1ForFork1_#t~mem2_52| (select (select |v_#memory_int_170| v_~A~0.base_79) .cse1)))) (or (and (not |v_thread1Thread1of1ForFork1_#t~short4_56|) (not .cse0)) (and |v_thread1Thread1of1ForFork1_#t~short4_56| .cse0))) (= (select |v_#valid_193| v_~A~0.base_79) 1) (= v_~sorted1~0_62 (ite (= (ite |v_thread1Thread1of1ForFork1_#t~short4_56| 1 0) 0) 0 1)) (= v_thread1Thread1of1ForFork1_~i~0_73 (+ v_thread1Thread1of1ForFork1_~i~0_74 1)) (<= 0 .cse1) (<= (+ v_~A~0.offset_79 8 .cse2) (select |v_#length_156| v_~A~0.base_79))))) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_52|, #valid=|v_#valid_193|, #memory_int=|v_#memory_int_170|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_74, #length=|v_#length_156|} OutVars{~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_33|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_55|, #valid=|v_#valid_193|, #memory_int=|v_#memory_int_170|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_73, #length=|v_#length_156|, ~sorted1~0=v_~sorted1~0_62} AuxVars[|v_thread1Thread1of1ForFork1_#t~short4_56|] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, ~sorted1~0] 8490#[L84-4, L47-5]don't care [580] L47-5-->L48-3: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork1_~i~0_35 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_33))) (and (<= (+ .cse0 v_~A~0.offset_33 4) (select |v_#length_72| v_~A~0.base_33)) |v_thread1Thread1of1ForFork1_#t~short4_25| (< (+ v_thread1Thread1of1ForFork1_~i~0_35 1) v_~N~0_29) (= (select |v_#valid_89| v_~A~0.base_33) 1) (<= 0 .cse1) (= (select (select |v_#memory_int_64| v_~A~0.base_33) .cse1) |v_thread1Thread1of1ForFork1_#t~mem2_17|) (not (= (mod v_~sorted1~0_24 256) 0))))) InVars {~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_64|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, #length=|v_#length_72|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} OutVars{~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_17|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_25|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_64|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, #length=|v_#length_72|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~short4] 8318#[L84-4, L48-3]don't care [2022-07-22 12:24:38,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:38,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1519550245, now seen corresponding path program 3 times [2022-07-22 12:24:38,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:38,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472712823] [2022-07-22 12:24:38,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:38,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:38,512 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:38,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:38,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:38,548 INFO L85 PathProgramCache]: Analyzing trace with hash 21722, now seen corresponding path program 3 times [2022-07-22 12:24:38,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:38,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768476029] [2022-07-22 12:24:38,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:38,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:38,555 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:38,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:38,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:38,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1074434, now seen corresponding path program 2 times [2022-07-22 12:24:38,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:38,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446511074] [2022-07-22 12:24:38,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:38,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:38,611 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:38,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:39,245 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:24:40,764 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:24:40,764 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:24:40,764 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:24:40,764 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:24:40,764 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:24:40,765 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:40,765 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:24:40,765 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:24:40,765 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sorted.wvr.c_BEv2_Iteration6_Lasso [2022-07-22 12:24:40,765 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:24:40,765 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:24:40,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:40,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:40,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:24:40,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:40,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:40,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:40,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:40,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:24:40,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:24:40,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:40,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:24:40,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:40,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:40,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:40,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:40,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:40,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:40,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:40,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:40,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:40,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:40,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:40,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:40,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:40,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:41,313 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 12:24:41,315 INFO L158 Benchmark]: Toolchain (without parser) took 22635.18ms. Allocated memory was 160.4MB in the beginning and 231.7MB in the end (delta: 71.3MB). Free memory was 135.6MB in the beginning and 197.7MB in the end (delta: -62.1MB). Peak memory consumption was 145.8MB. Max. memory is 8.0GB. [2022-07-22 12:24:41,315 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 160.4MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:24:41,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.47ms. Allocated memory is still 160.4MB. Free memory was 135.5MB in the beginning and 124.2MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 12:24:41,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.07ms. Allocated memory is still 160.4MB. Free memory was 124.2MB in the beginning and 122.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:24:41,317 INFO L158 Benchmark]: Boogie Preprocessor took 57.97ms. Allocated memory is still 160.4MB. Free memory was 122.5MB in the beginning and 121.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:24:41,317 INFO L158 Benchmark]: RCFGBuilder took 745.23ms. Allocated memory is still 160.4MB. Free memory was 120.8MB in the beginning and 132.7MB in the end (delta: -11.9MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. [2022-07-22 12:24:41,317 INFO L158 Benchmark]: BuchiAutomizer took 21451.92ms. Allocated memory was 160.4MB in the beginning and 231.7MB in the end (delta: 71.3MB). Free memory was 132.2MB in the beginning and 197.7MB in the end (delta: -65.5MB). Peak memory consumption was 143.6MB. Max. memory is 8.0GB. [2022-07-22 12:24:41,319 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.34ms. Allocated memory is still 160.4MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 312.47ms. Allocated memory is still 160.4MB. Free memory was 135.5MB in the beginning and 124.2MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.07ms. Allocated memory is still 160.4MB. Free memory was 124.2MB in the beginning and 122.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.97ms. Allocated memory is still 160.4MB. Free memory was 122.5MB in the beginning and 121.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 745.23ms. Allocated memory is still 160.4MB. Free memory was 120.8MB in the beginning and 132.7MB in the end (delta: -11.9MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 21451.92ms. Allocated memory was 160.4MB in the beginning and 231.7MB in the end (delta: 71.3MB). Free memory was 132.2MB in the beginning and 197.7MB in the end (delta: -65.5MB). Peak memory consumption was 143.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.8s, 172 PlacesBefore, 32 PlacesAfterwards, 177 TransitionsBefore, 28 TransitionsAfterwards, 3534 CoEnabledTransitionPairs, 8 FixpointIterations, 90 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 25 ConcurrentYvCompositions, 9 ChoiceCompositions, 180 TotalNumberOfCompositions, 4228 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3797, positive: 3749, positive conditional: 0, positive unconditional: 3749, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2574, positive: 2554, positive conditional: 0, positive unconditional: 2554, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2574, positive: 2554, positive conditional: 0, positive unconditional: 2554, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 105, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 105, negative conditional: 0, negative unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3797, positive: 1195, positive conditional: 0, positive unconditional: 1195, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 2574, unknown conditional: 0, unknown unconditional: 2574] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 111, Positive conditional cache size: 0, Positive unconditional cache size: 111, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 12:24:41,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:41,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:41,749 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...