/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 14:18:06,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 14:18:06,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 14:18:06,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 14:18:06,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 14:18:06,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 14:18:06,109 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 14:18:06,113 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 14:18:06,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 14:18:06,119 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 14:18:06,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 14:18:06,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 14:18:06,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 14:18:06,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 14:18:06,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 14:18:06,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 14:18:06,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 14:18:06,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 14:18:06,130 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 14:18:06,134 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 14:18:06,135 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 14:18:06,135 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 14:18:06,136 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 14:18:06,137 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 14:18:06,138 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 14:18:06,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 14:18:06,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 14:18:06,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 14:18:06,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 14:18:06,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 14:18:06,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 14:18:06,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 14:18:06,145 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 14:18:06,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 14:18:06,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 14:18:06,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 14:18:06,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 14:18:06,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 14:18:06,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 14:18:06,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 14:18:06,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 14:18:06,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 14:18:06,155 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-26 14:18:06,187 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 14:18:06,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 14:18:06,187 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 14:18:06,188 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 14:18:06,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 14:18:06,189 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 14:18:06,189 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 14:18:06,189 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 14:18:06,189 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 14:18:06,190 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 14:18:06,190 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 14:18:06,190 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 14:18:06,190 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 14:18:06,190 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 14:18:06,191 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 14:18:06,192 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 14:18:06,192 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 14:18:06,192 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 14:18:06,192 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 14:18:06,192 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 14:18:06,192 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 14:18:06,192 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 14:18:06,192 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 14:18:06,192 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 14:18:06,193 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 14:18:06,193 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 14:18:06,193 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 14:18:06,193 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 14:18:06,193 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 14:18:06,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 14:18:06,194 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 14:18:06,194 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-26 14:18:06,194 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 14:18:06,194 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-07-26 14:18:06,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 14:18:06,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 14:18:06,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 14:18:06,458 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 14:18:06,459 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 14:18:06,460 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2022-07-26 14:18:06,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fddb667d/b60d332e8b254d1db60cc9c39ae339b7/FLAGa9784f5fc [2022-07-26 14:18:06,932 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 14:18:06,932 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2022-07-26 14:18:06,937 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fddb667d/b60d332e8b254d1db60cc9c39ae339b7/FLAGa9784f5fc [2022-07-26 14:18:06,948 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fddb667d/b60d332e8b254d1db60cc9c39ae339b7 [2022-07-26 14:18:06,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 14:18:06,951 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 14:18:06,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 14:18:06,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 14:18:06,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 14:18:06,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:18:06" (1/1) ... [2022-07-26 14:18:06,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44e1a212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:06, skipping insertion in model container [2022-07-26 14:18:06,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:18:06" (1/1) ... [2022-07-26 14:18:06,977 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 14:18:06,994 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 14:18:07,176 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-queue-add-2-nl.wvr.c[2870,2883] [2022-07-26 14:18:07,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:18:07,187 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 14:18:07,203 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-queue-add-2-nl.wvr.c[2870,2883] [2022-07-26 14:18:07,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:18:07,217 INFO L208 MainTranslator]: Completed translation [2022-07-26 14:18:07,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:07 WrapperNode [2022-07-26 14:18:07,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 14:18:07,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 14:18:07,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 14:18:07,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 14:18:07,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:07" (1/1) ... [2022-07-26 14:18:07,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:07" (1/1) ... [2022-07-26 14:18:07,254 INFO L137 Inliner]: procedures = 25, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 159 [2022-07-26 14:18:07,255 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 14:18:07,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 14:18:07,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 14:18:07,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 14:18:07,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:07" (1/1) ... [2022-07-26 14:18:07,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:07" (1/1) ... [2022-07-26 14:18:07,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:07" (1/1) ... [2022-07-26 14:18:07,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:07" (1/1) ... [2022-07-26 14:18:07,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:07" (1/1) ... [2022-07-26 14:18:07,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:07" (1/1) ... [2022-07-26 14:18:07,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:07" (1/1) ... [2022-07-26 14:18:07,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 14:18:07,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 14:18:07,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 14:18:07,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 14:18:07,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:07" (1/1) ... [2022-07-26 14:18:07,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:07,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:07,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:07,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-26 14:18:07,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 14:18:07,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 14:18:07,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 14:18:07,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 14:18:07,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-26 14:18:07,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-26 14:18:07,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-26 14:18:07,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-26 14:18:07,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 14:18:07,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-26 14:18:07,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-26 14:18:07,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-26 14:18:07,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 14:18:07,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 14:18:07,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 14:18:07,356 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-26 14:18:07,473 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 14:18:07,475 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 14:18:07,793 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 14:18:07,877 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 14:18:07,877 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-26 14:18:07,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:18:07 BoogieIcfgContainer [2022-07-26 14:18:07,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 14:18:07,881 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 14:18:07,881 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 14:18:07,885 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 14:18:07,886 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:18:07,886 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 02:18:06" (1/3) ... [2022-07-26 14:18:07,887 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ccf2206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:18:07, skipping insertion in model container [2022-07-26 14:18:07,887 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:18:07,887 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:07" (2/3) ... [2022-07-26 14:18:07,888 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ccf2206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:18:07, skipping insertion in model container [2022-07-26 14:18:07,888 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:18:07,888 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:18:07" (3/3) ... [2022-07-26 14:18:07,890 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2022-07-26 14:18:08,000 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-26 14:18:08,029 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 136 places, 142 transitions, 300 flow [2022-07-26 14:18:08,090 INFO L129 PetriNetUnfolder]: 11/138 cut-off events. [2022-07-26 14:18:08,090 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 14:18:08,093 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 138 events. 11/138 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 102. Up to 3 conditions per place. [2022-07-26 14:18:08,094 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 142 transitions, 300 flow [2022-07-26 14:18:08,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 138 transitions, 288 flow [2022-07-26 14:18:08,107 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-26 14:18:08,113 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 138 transitions, 288 flow [2022-07-26 14:18:08,116 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 138 transitions, 288 flow [2022-07-26 14:18:08,116 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 134 places, 138 transitions, 288 flow [2022-07-26 14:18:08,160 INFO L129 PetriNetUnfolder]: 11/138 cut-off events. [2022-07-26 14:18:08,160 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 14:18:08,161 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 138 events. 11/138 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 102. Up to 3 conditions per place. [2022-07-26 14:18:08,162 INFO L116 LiptonReduction]: Number of co-enabled transitions 690 [2022-07-26 14:18:12,526 INFO L131 LiptonReduction]: Checked pairs total: 833 [2022-07-26 14:18:12,527 INFO L133 LiptonReduction]: Total number of compositions: 149 [2022-07-26 14:18:12,541 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 14:18:12,542 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 14:18:12,542 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 14:18:12,542 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 14:18:12,542 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 14:18:12,542 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 14:18:12,542 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 14:18:12,542 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 14:18:12,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 14:18:12,566 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2022-07-26 14:18:12,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:18:12,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:18:12,570 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 14:18:12,570 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:18:12,571 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 14:18:12,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 34 states, but on-demand construction may add more states [2022-07-26 14:18:12,574 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2022-07-26 14:18:12,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:18:12,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:18:12,574 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 14:18:12,574 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:18:12,578 INFO L733 eck$LassoCheckResult]: Stem: 139#[ULTIMATE.startENTRY]don't care [632] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_7| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= 0 |v_#NULL.base_Out_2|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_1|) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_6|) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= v_~q_back~0_Out_6 v_~q_front~0_Out_6) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_2| 0) (= (select |v_#valid_In_7| 1) 1) (= 48 (select .cse1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~q~0.offset_Out_6 0) (= (select .cse1 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= v_~s~0_Out_6 0) (= v_~x~0_Out_2 0) (= 2 (select |v_#length_In_7| 1)) (< 0 |v_#StackHeapBarrier_In_1|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (= (select |v_#length_In_7| 2) 33) (= |v_#length_Out_2| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~y~0_Out_6 0) (= v_~q~0.base_Out_6 0)))) InVars {#memory_int=|v_#memory_int_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_6|, ~q_back~0=v_~q_back~0_Out_6, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~q~0.offset=v_~q~0.offset_Out_6, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_Out_2|, #length=|v_#length_Out_2|, ~y~0=v_~y~0_Out_6, ~q_front~0=v_~q_front~0_Out_6, ~s~0=v_~s~0_Out_6, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ~C~0=v_~C~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~q~0.base=v_~q~0.base_Out_6, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_6|, #memory_int=|v_#memory_int_In_7|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_Out_2|, ~n~0=v_~n~0_Out_2, ~x~0=v_~x~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~mem18#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~q~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~y~0, ~q_front~0, ~s~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~C~0, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_~#t1~0#1.base, ~q~0.base, 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, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] 142#[L115-6]don't care [2022-07-26 14:18:12,578 INFO L735 eck$LassoCheckResult]: Loop: 142#[L115-6]don't care [586] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_25| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_28|) (<= 0 .cse0) (= (select |v_#valid_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (= (store |v_#memory_int_91| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_91| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_15|)) |v_#memory_int_90|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_25| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_24|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_105| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_91|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_15|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_25|, #length=|v_#length_105|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_28|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_90|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_24|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_15|, #length=|v_#length_105|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_28|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 142#[L115-6]don't care [2022-07-26 14:18:12,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:12,582 INFO L85 PathProgramCache]: Analyzing trace with hash 663, now seen corresponding path program 1 times [2022-07-26 14:18:12,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:18:12,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974853474] [2022-07-26 14:18:12,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:18:12,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:18:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:12,686 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:18:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:12,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:18:12,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:12,745 INFO L85 PathProgramCache]: Analyzing trace with hash 617, now seen corresponding path program 1 times [2022-07-26 14:18:12,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:18:12,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966941848] [2022-07-26 14:18:12,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:18:12,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:18:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:12,771 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:18:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:12,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:18:12,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:12,778 INFO L85 PathProgramCache]: Analyzing trace with hash 21139, now seen corresponding path program 1 times [2022-07-26 14:18:12,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:18:12,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360746881] [2022-07-26 14:18:12,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:18:12,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:18:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:12,807 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:18:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:12,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:18:13,324 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:18:13,324 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:18:13,324 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:18:13,324 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:18:13,325 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:18:13,325 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:13,325 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:18:13,325 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:18:13,325 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-queue-add-2-nl.wvr.c_BEv2_Iteration1_Lasso [2022-07-26 14:18:13,325 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:18:13,325 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:18:13,341 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,346 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,348 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,350 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,353 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,356 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,358 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,360 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,362 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,364 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,366 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,368 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,371 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,373 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,652 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,655 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,657 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,659 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,661 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,663 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,665 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,667 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,669 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,674 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,676 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,679 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,681 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,683 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,685 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,687 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,689 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,690 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,694 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,695 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,697 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:13,699 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:14,129 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:18:14,133 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:18:14,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:14,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:14,139 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:14,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:14,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:14,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:14,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:14,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:14,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:14,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:14,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:14,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-26 14:18:14,171 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:14,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:14,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:14,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:14,197 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:14,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:14,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:14,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:14,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:14,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:14,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:14,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:14,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-26 14:18:14,217 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:14,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:14,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:14,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:14,242 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:14,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-26 14:18:14,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-26 14:18:14,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:14,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:14,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:14,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:14,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:14,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:14,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:14,267 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:14,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:14,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:14,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:14,294 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:14,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:14,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:14,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:14,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:14,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:14,315 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:14,315 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:14,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-26 14:18:14,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:14,352 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-26 14:18:14,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:14,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:14,354 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:14,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-26 14:18:14,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:14,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:14,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:14,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:14,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:14,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:14,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:14,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:14,379 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:14,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:14,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:14,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:14,403 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:14,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-26 14:18:14,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:14,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:14,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:14,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:14,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:14,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:14,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:14,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:14,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:14,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:14,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:14,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:14,457 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:14,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:14,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:14,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:14,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:14,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:14,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:14,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:14,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:14,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-26 14:18:14,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:14,507 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-26 14:18:14,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:14,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:14,511 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:14,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:14,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:14,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:14,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:14,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:14,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:14,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:14,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:14,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-26 14:18:14,544 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:14,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:14,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:14,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:14,573 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:14,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-26 14:18:14,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:14,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:14,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:14,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:14,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:14,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:14,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:14,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:14,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:14,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:14,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:14,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:14,626 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:14,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:14,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:14,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:14,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:14,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:14,645 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:14,645 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:14,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-26 14:18:14,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:14,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:14,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:14,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:14,682 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:14,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-26 14:18:14,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:14,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:14,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:14,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:14,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:14,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:14,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:14,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:14,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:14,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:14,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:14,737 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:14,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-26 14:18:14,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:14,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:14,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:14,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:14,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:14,752 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:14,752 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:14,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:14,791 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-26 14:18:14,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:14,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:14,792 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:14,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-26 14:18:14,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:14,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:14,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:14,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:14,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:14,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:14,805 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:14,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:14,851 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-26 14:18:14,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:14,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:14,853 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:14,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:14,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:14,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:14,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:14,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:14,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:14,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:14,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-26 14:18:14,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:14,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:14,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:14,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:14,908 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:14,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-26 14:18:14,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:14,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:14,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:14,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:14,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:14,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:14,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:14,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:14,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:14,957 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-26 14:18:14,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:14,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:14,959 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:14,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-26 14:18:14,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-26 14:18:14,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:14,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:14,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:14,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:14,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:14,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:14,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:15,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:15,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:15,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:15,026 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:15,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-26 14:18:15,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:15,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:15,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:15,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:15,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:15,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:15,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:15,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:15,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:15,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:15,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:15,082 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:15,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-26 14:18:15,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:15,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:15,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:15,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:15,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:15,103 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:15,104 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:15,120 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:18:15,170 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2022-07-26 14:18:15,171 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-07-26 14:18:15,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:15,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:15,174 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:15,185 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:18:15,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-26 14:18:15,218 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-26 14:18:15,218 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:18:15,219 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~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~1#1 + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_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-26 14:18:15,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:15,332 INFO L156 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2022-07-26 14:18:15,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:18:15,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-26 14:18:15,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:18:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:18:15,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-26 14:18:15,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:18:15,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:18:15,445 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:18:15,447 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 34 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-26 14:18:15,517 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 34 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 68 states and 150 transitions. Complement of second has 5 states. [2022-07-26 14:18:15,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:18:15,523 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-26 14:18:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-07-26 14:18:15,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-26 14:18:15,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:18:15,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-26 14:18:15,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:18:15,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-26 14:18:15,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:18:15,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 150 transitions. [2022-07-26 14:18:15,529 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-26 14:18:15,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 30 states and 66 transitions. [2022-07-26 14:18:15,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-07-26 14:18:15,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-26 14:18:15,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 66 transitions. [2022-07-26 14:18:15,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:18:15,535 INFO L220 hiAutomatonCegarLoop]: Abstraction has 30 states and 66 transitions. [2022-07-26 14:18:15,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 66 transitions. [2022-07-26 14:18:15,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-26 14:18:15,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.2) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:18:15,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 66 transitions. [2022-07-26 14:18:15,556 INFO L242 hiAutomatonCegarLoop]: Abstraction has 30 states and 66 transitions. [2022-07-26 14:18:15,557 INFO L426 stractBuchiCegarLoop]: Abstraction has 30 states and 66 transitions. [2022-07-26 14:18:15,557 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 14:18:15,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 66 transitions. [2022-07-26 14:18:15,558 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-26 14:18:15,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:18:15,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:18:15,558 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-26 14:18:15,558 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:18:15,559 INFO L733 eck$LassoCheckResult]: Stem: 416#[ULTIMATE.startENTRY]don't care [632] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_7| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= 0 |v_#NULL.base_Out_2|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_1|) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_6|) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= v_~q_back~0_Out_6 v_~q_front~0_Out_6) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_2| 0) (= (select |v_#valid_In_7| 1) 1) (= 48 (select .cse1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~q~0.offset_Out_6 0) (= (select .cse1 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= v_~s~0_Out_6 0) (= v_~x~0_Out_2 0) (= 2 (select |v_#length_In_7| 1)) (< 0 |v_#StackHeapBarrier_In_1|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (= (select |v_#length_In_7| 2) 33) (= |v_#length_Out_2| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~y~0_Out_6 0) (= v_~q~0.base_Out_6 0)))) InVars {#memory_int=|v_#memory_int_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_6|, ~q_back~0=v_~q_back~0_Out_6, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~q~0.offset=v_~q~0.offset_Out_6, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_Out_2|, #length=|v_#length_Out_2|, ~y~0=v_~y~0_Out_6, ~q_front~0=v_~q_front~0_Out_6, ~s~0=v_~s~0_Out_6, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ~C~0=v_~C~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~q~0.base=v_~q~0.base_Out_6, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_6|, #memory_int=|v_#memory_int_In_7|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_Out_2|, ~n~0=v_~n~0_Out_2, ~x~0=v_~x~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~mem18#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~q~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~y~0, ~q_front~0, ~s~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~C~0, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_~#t1~0#1.base, ~q~0.base, 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, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] 400#[L115-6]don't care [625] L115-6-->L99-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= (store |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre13#1_Out_2|)) |v_#memory_int_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= v_~q~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~q~0.base_Out_2) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre13#1_Out_2|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (<= 0 v_~N~0_In_3) 1 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_3|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_In_3, ~q~0.base=v_~q~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ~q~0.offset=v_~q~0.offset_Out_2, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_5|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #memory_int, ~q~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~q~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] 402#[L99-3]don't care [481] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_4|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 418#[thread1ENTRY, L99-4]don't care [451] thread1ENTRY-->L49-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 384#[L49-5, L99-4]don't care [2022-07-26 14:18:15,559 INFO L735 eck$LassoCheckResult]: Loop: 384#[L49-5, L99-4]don't care [601] L49-5-->L49-5: Formula: (let ((.cse0 (* v_~q_back~0_127 4))) (let ((.cse1 (+ v_~q~0.offset_60 .cse0))) (and (<= (+ v_~q~0.offset_60 .cse0 4) (select |v_#length_127| v_~q~0.base_60)) (< |v_thread1Thread1of1ForFork1_~i~0#1_28| v_~N~0_35) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15| (ite (= (select (select |v_#memory_int_104| v_~q~0.base_60) .cse1) 1) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_28| 1) |v_thread1Thread1of1ForFork1_~i~0#1_27|) (<= 0 .cse1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|) (= (select |v_#valid_152| v_~q~0.base_60) 1) (not (= (ite (and (< v_~q_back~0_127 v_~n~0_63) (<= 0 v_~q_back~0_127)) 1 0) 0)) (= v_~x~0_39 (+ v_~x~0_40 v_~C~0_36)) (= (+ v_~q_back~0_127 1) v_~q_back~0_126) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))))) InVars {~q_back~0=v_~q_back~0_127, ~C~0=v_~C~0_36, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_28|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_104|, #length=|v_#length_127|, ~N~0=v_~N~0_35, ~q~0.base=v_~q~0.base_60, ~n~0=v_~n~0_63, ~x~0=v_~x~0_40, ~q~0.offset=v_~q~0.offset_60} OutVars{~q_back~0=v_~q_back~0_126, ~C~0=v_~C~0_36, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_7|, ~N~0=v_~N~0_35, ~q~0.base=v_~q~0.base_60, ~q~0.offset=v_~q~0.offset_60, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_19|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_7|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_27|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_104|, #length=|v_#length_127|, ~n~0=v_~n~0_63, ~x~0=v_~x~0_39, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 384#[L49-5, L99-4]don't care [2022-07-26 14:18:15,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:15,560 INFO L85 PathProgramCache]: Analyzing trace with hash 20367420, now seen corresponding path program 1 times [2022-07-26 14:18:15,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:18:15,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490337599] [2022-07-26 14:18:15,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:18:15,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:18:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:15,582 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:18:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:15,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:18:15,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:15,604 INFO L85 PathProgramCache]: Analyzing trace with hash 632, now seen corresponding path program 1 times [2022-07-26 14:18:15,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:18:15,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151533032] [2022-07-26 14:18:15,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:18:15,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:18:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:15,611 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:18:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:15,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:18:15,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:15,618 INFO L85 PathProgramCache]: Analyzing trace with hash 631390621, now seen corresponding path program 1 times [2022-07-26 14:18:15,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:18:15,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90353525] [2022-07-26 14:18:15,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:18:15,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:18:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:18:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:18:15,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:18:15,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90353525] [2022-07-26 14:18:15,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90353525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:18:15,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:18:15,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 14:18:15,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809459423] [2022-07-26 14:18:15,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:18:15,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:18:15,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 14:18:15,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 14:18:15,821 INFO L87 Difference]: Start difference. First operand 30 states and 66 transitions. cyclomatic complexity: 51 Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-26 14:18:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:18:15,874 INFO L93 Difference]: Finished difference Result 43 states and 85 transitions. [2022-07-26 14:18:15,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 85 transitions. [2022-07-26 14:18:15,878 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-26 14:18:15,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 65 transitions. [2022-07-26 14:18:15,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-07-26 14:18:15,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-26 14:18:15,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 65 transitions. [2022-07-26 14:18:15,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:18:15,882 INFO L220 hiAutomatonCegarLoop]: Abstraction has 30 states and 65 transitions. [2022-07-26 14:18:15,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 65 transitions. [2022-07-26 14:18:15,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-26 14:18:15,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:18:15,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 65 transitions. [2022-07-26 14:18:15,889 INFO L242 hiAutomatonCegarLoop]: Abstraction has 30 states and 65 transitions. [2022-07-26 14:18:15,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-26 14:18:15,890 INFO L426 stractBuchiCegarLoop]: Abstraction has 30 states and 65 transitions. [2022-07-26 14:18:15,890 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 14:18:15,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 65 transitions. [2022-07-26 14:18:15,893 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-26 14:18:15,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:18:15,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:18:15,895 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-26 14:18:15,895 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:18:15,896 INFO L733 eck$LassoCheckResult]: Stem: 530#[ULTIMATE.startENTRY]don't care [632] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_7| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= 0 |v_#NULL.base_Out_2|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_1|) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_6|) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= v_~q_back~0_Out_6 v_~q_front~0_Out_6) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_2| 0) (= (select |v_#valid_In_7| 1) 1) (= 48 (select .cse1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~q~0.offset_Out_6 0) (= (select .cse1 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= v_~s~0_Out_6 0) (= v_~x~0_Out_2 0) (= 2 (select |v_#length_In_7| 1)) (< 0 |v_#StackHeapBarrier_In_1|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (= (select |v_#length_In_7| 2) 33) (= |v_#length_Out_2| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~y~0_Out_6 0) (= v_~q~0.base_Out_6 0)))) InVars {#memory_int=|v_#memory_int_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_6|, ~q_back~0=v_~q_back~0_Out_6, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~q~0.offset=v_~q~0.offset_Out_6, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_Out_2|, #length=|v_#length_Out_2|, ~y~0=v_~y~0_Out_6, ~q_front~0=v_~q_front~0_Out_6, ~s~0=v_~s~0_Out_6, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ~C~0=v_~C~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~q~0.base=v_~q~0.base_Out_6, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_6|, #memory_int=|v_#memory_int_In_7|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_Out_2|, ~n~0=v_~n~0_Out_2, ~x~0=v_~x~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~mem18#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~q~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~y~0, ~q_front~0, ~s~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~C~0, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_~#t1~0#1.base, ~q~0.base, 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, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] 514#[L115-6]don't care [586] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_25| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_28|) (<= 0 .cse0) (= (select |v_#valid_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (= (store |v_#memory_int_91| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_91| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_15|)) |v_#memory_int_90|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_25| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_24|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_105| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_91|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_15|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_25|, #length=|v_#length_105|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_28|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_90|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_24|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_15|, #length=|v_#length_105|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_28|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 516#[L115-6]don't care [625] L115-6-->L99-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= (store |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre13#1_Out_2|)) |v_#memory_int_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= v_~q~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~q~0.base_Out_2) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre13#1_Out_2|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (<= 0 v_~N~0_In_3) 1 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_3|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_In_3, ~q~0.base=v_~q~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ~q~0.offset=v_~q~0.offset_Out_2, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_5|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #memory_int, ~q~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~q~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] 518#[L99-3]don't care [481] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_4|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 532#[thread1ENTRY, L99-4]don't care [451] thread1ENTRY-->L49-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 498#[L49-5, L99-4]don't care [2022-07-26 14:18:15,896 INFO L735 eck$LassoCheckResult]: Loop: 498#[L49-5, L99-4]don't care [601] L49-5-->L49-5: Formula: (let ((.cse0 (* v_~q_back~0_127 4))) (let ((.cse1 (+ v_~q~0.offset_60 .cse0))) (and (<= (+ v_~q~0.offset_60 .cse0 4) (select |v_#length_127| v_~q~0.base_60)) (< |v_thread1Thread1of1ForFork1_~i~0#1_28| v_~N~0_35) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15| (ite (= (select (select |v_#memory_int_104| v_~q~0.base_60) .cse1) 1) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_28| 1) |v_thread1Thread1of1ForFork1_~i~0#1_27|) (<= 0 .cse1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|) (= (select |v_#valid_152| v_~q~0.base_60) 1) (not (= (ite (and (< v_~q_back~0_127 v_~n~0_63) (<= 0 v_~q_back~0_127)) 1 0) 0)) (= v_~x~0_39 (+ v_~x~0_40 v_~C~0_36)) (= (+ v_~q_back~0_127 1) v_~q_back~0_126) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))))) InVars {~q_back~0=v_~q_back~0_127, ~C~0=v_~C~0_36, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_28|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_104|, #length=|v_#length_127|, ~N~0=v_~N~0_35, ~q~0.base=v_~q~0.base_60, ~n~0=v_~n~0_63, ~x~0=v_~x~0_40, ~q~0.offset=v_~q~0.offset_60} OutVars{~q_back~0=v_~q_back~0_126, ~C~0=v_~C~0_36, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_7|, ~N~0=v_~N~0_35, ~q~0.base=v_~q~0.base_60, ~q~0.offset=v_~q~0.offset_60, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_19|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_7|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_27|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_104|, #length=|v_#length_127|, ~n~0=v_~n~0_63, ~x~0=v_~x~0_39, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 498#[L49-5, L99-4]don't care [2022-07-26 14:18:15,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:15,897 INFO L85 PathProgramCache]: Analyzing trace with hash 630367936, now seen corresponding path program 1 times [2022-07-26 14:18:15,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:18:15,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908621774] [2022-07-26 14:18:15,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:18:15,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:18:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:15,941 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:18:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:15,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:18:15,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:15,973 INFO L85 PathProgramCache]: Analyzing trace with hash 632, now seen corresponding path program 2 times [2022-07-26 14:18:15,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:18:15,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155764947] [2022-07-26 14:18:15,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:18:15,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:18:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:15,985 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:18:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:16,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:18:16,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:16,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1933429863, now seen corresponding path program 1 times [2022-07-26 14:18:16,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:18:16,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538065580] [2022-07-26 14:18:16,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:18:16,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:18:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:16,043 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:18:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:16,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:18:17,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:17,520 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:18:17,521 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:18:17,521 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:18:17,521 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:18:17,521 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:18:17,521 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:17,521 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:18:17,521 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:18:17,521 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-queue-add-2-nl.wvr.c_BEv2_Iteration3_Lasso [2022-07-26 14:18:17,521 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:18:17,521 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:18:17,526 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:17,532 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:17,536 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:17,538 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:17,540 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:17,542 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:17,544 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:17,546 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:17,548 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:17,550 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:17,552 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:17,553 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:17,555 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:17,557 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:17,559 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:17,564 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:17,567 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:17,568 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:17,570 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:17,572 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:17,574 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:17,576 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:18,150 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:18,152 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:18,159 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:18,161 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:18,163 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:18,164 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:18,169 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:18,172 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:18,174 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:18,176 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:18,178 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:18,179 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:18,181 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:18,182 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:18,186 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:18,194 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:18,681 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:18:18,681 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:18:18,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:18,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:18,682 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:18,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-26 14:18:18,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:18,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:18,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:18,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:18,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:18,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:18,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:18,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:18,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:18,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:18,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:18,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:18,713 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:18,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-26 14:18:18,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:18,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:18,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:18,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:18,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:18,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:18,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:18,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:18,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:18,738 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-26 14:18:18,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:18,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:18,739 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:18,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-26 14:18:18,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:18,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:18,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:18,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:18,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:18,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:18,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:18,761 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:18,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-26 14:18:18,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-26 14:18:18,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:18,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:18,777 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:18,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-26 14:18:18,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:18,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:18,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:18,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:18,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:18,787 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:18,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:18,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:18,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:18,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:18,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:18,821 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:18,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:18,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:18,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:18,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:18,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:18,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:18,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:18,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:18,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-26 14:18:18,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:18,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:18,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:18,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:18,859 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:18,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-26 14:18:18,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:18,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:18,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:18,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:18,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:18,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:18,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:18,869 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:18,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-26 14:18:18,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:18,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:18,888 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:18,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-26 14:18:18,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:18,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:18,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:18,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:18,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:18,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:18,897 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:18,897 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:18,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:18,919 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-26 14:18:18,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:18,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:18,920 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:18,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-26 14:18:18,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-26 14:18:18,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:18,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:18,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:18,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:18,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:18,930 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:18,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:18,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-26 14:18:18,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:18,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:18,951 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:18,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-26 14:18:18,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:18,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:18,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:18,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:18,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:18,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:18,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:18,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:18,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:18,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-26 14:18:18,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:18,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:18,976 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:18,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-26 14:18:18,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:18,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:18,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:18,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:18,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:18,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:18,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:18,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:18,985 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:19,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,010 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:19,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-26 14:18:19,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:19,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:19,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:19,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:19,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:19,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,060 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:19,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-26 14:18:19,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:19,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:19,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:19,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:19,074 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-26 14:18:19,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,090 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:19,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-26 14:18:19,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:19,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:19,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:19,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:19,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:19,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,117 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:19,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-26 14:18:19,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:19,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:19,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:19,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:19,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-26 14:18:19,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,142 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:19,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-26 14:18:19,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:19,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:19,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:19,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:19,153 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,169 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-26 14:18:19,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,175 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:19,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-26 14:18:19,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:19,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,187 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:19,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:19,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-26 14:18:19,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,213 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:19,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-26 14:18:19,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:19,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:19,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:19,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:19,228 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:19,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,245 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:19,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-26 14:18:19,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:19,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:19,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:19,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:19,254 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-26 14:18:19,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,270 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:19,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-26 14:18:19,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:19,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:19,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:19,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:19,289 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,313 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-26 14:18:19,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,314 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:19,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:19,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:19,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:19,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:19,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-26 14:18:19,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,358 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-26 14:18:19,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,359 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:19,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:19,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:19,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:19,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:19,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-26 14:18:19,383 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,406 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-26 14:18:19,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,408 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:19,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:19,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,422 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:19,422 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:19,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-26 14:18:19,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:19,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,458 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:19,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:19,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:19,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:19,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-26 14:18:19,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:19,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,507 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:19,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-26 14:18:19,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:19,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,522 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:19,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:19,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,560 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-26 14:18:19,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,562 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-26 14:18:19,565 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-26 14:18:19,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:19,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:19,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:19,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,591 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-26 14:18:19,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,592 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-26 14:18:19,592 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-26 14:18:19,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:19,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:19,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:19,606 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,622 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-26 14:18:19,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,625 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-26 14:18:19,626 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-26 14:18:19,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:19,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:19,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:19,637 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-07-26 14:18:19,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,653 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-26 14:18:19,653 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-26 14:18:19,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:19,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:19,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:19,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,678 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-26 14:18:19,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,679 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-26 14:18:19,680 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-26 14:18:19,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:19,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:19,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:19,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-26 14:18:19,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,715 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-26 14:18:19,719 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-26 14:18:19,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:19,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:19,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:19,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:19,726 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,740 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-26 14:18:19,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,741 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-26 14:18:19,742 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-26 14:18:19,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:19,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,750 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:19,750 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:19,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,770 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-26 14:18:19,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,771 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-26 14:18:19,771 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-26 14:18:19,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:19,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,780 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:19,780 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:19,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:19,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-26 14:18:19,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,801 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:19,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-26 14:18:19,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-26 14:18:19,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:19,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:19,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:19,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:19,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:19,831 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:19,840 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:18:19,859 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-26 14:18:19,859 INFO L444 ModelExtractionUtils]: 14 out of 37 variables were initially zero. Simplification set additionally 20 variables to zero. [2022-07-26 14:18:19,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:19,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:19,860 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:18:19,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-26 14:18:19,862 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:18:19,889 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:18:19,889 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:18:19,889 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q_back~0, ~n~0) = -1*~q_back~0 + 1*~n~0 Supporting invariants [] [2022-07-26 14:18:19,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-07-26 14:18:19,968 INFO L156 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2022-07-26 14:18:19,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:18:20,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:18:20,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:18:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:18:20,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:18:20,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:18:20,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:18:20,016 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:18:20,016 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 65 transitions. cyclomatic complexity: 50 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:18:20,049 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 65 transitions. cyclomatic complexity: 50. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 78 states and 199 transitions. Complement of second has 4 states. [2022-07-26 14:18:20,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:18:20,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:18:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-07-26 14:18:20,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-26 14:18:20,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:18:20,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-26 14:18:20,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:18:20,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-26 14:18:20,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:18:20,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 199 transitions. [2022-07-26 14:18:20,053 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2022-07-26 14:18:20,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 57 states and 142 transitions. [2022-07-26 14:18:20,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-07-26 14:18:20,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-07-26 14:18:20,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 142 transitions. [2022-07-26 14:18:20,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:18:20,054 INFO L220 hiAutomatonCegarLoop]: Abstraction has 57 states and 142 transitions. [2022-07-26 14:18:20,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 142 transitions. [2022-07-26 14:18:20,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2022-07-26 14:18:20,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.738095238095238) internal successors, (115), 41 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:18:20,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 115 transitions. [2022-07-26 14:18:20,058 INFO L242 hiAutomatonCegarLoop]: Abstraction has 42 states and 115 transitions. [2022-07-26 14:18:20,058 INFO L426 stractBuchiCegarLoop]: Abstraction has 42 states and 115 transitions. [2022-07-26 14:18:20,058 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-26 14:18:20,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 115 transitions. [2022-07-26 14:18:20,059 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2022-07-26 14:18:20,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:18:20,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:18:20,059 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:18:20,059 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:18:20,060 INFO L733 eck$LassoCheckResult]: Stem: 820#[ULTIMATE.startENTRY]don't care [632] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_7| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= 0 |v_#NULL.base_Out_2|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_1|) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_6|) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= v_~q_back~0_Out_6 v_~q_front~0_Out_6) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_2| 0) (= (select |v_#valid_In_7| 1) 1) (= 48 (select .cse1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~q~0.offset_Out_6 0) (= (select .cse1 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= v_~s~0_Out_6 0) (= v_~x~0_Out_2 0) (= 2 (select |v_#length_In_7| 1)) (< 0 |v_#StackHeapBarrier_In_1|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (= (select |v_#length_In_7| 2) 33) (= |v_#length_Out_2| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~y~0_Out_6 0) (= v_~q~0.base_Out_6 0)))) InVars {#memory_int=|v_#memory_int_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_6|, ~q_back~0=v_~q_back~0_Out_6, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~q~0.offset=v_~q~0.offset_Out_6, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_Out_2|, #length=|v_#length_Out_2|, ~y~0=v_~y~0_Out_6, ~q_front~0=v_~q_front~0_Out_6, ~s~0=v_~s~0_Out_6, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ~C~0=v_~C~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~q~0.base=v_~q~0.base_Out_6, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_6|, #memory_int=|v_#memory_int_In_7|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_Out_2|, ~n~0=v_~n~0_Out_2, ~x~0=v_~x~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~mem18#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~q~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~y~0, ~q_front~0, ~s~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~C~0, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_~#t1~0#1.base, ~q~0.base, 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, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] 786#[L115-6]don't care [586] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_25| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_28|) (<= 0 .cse0) (= (select |v_#valid_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (= (store |v_#memory_int_91| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_91| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_15|)) |v_#memory_int_90|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_25| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_24|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_105| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_91|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_15|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_25|, #length=|v_#length_105|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_28|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_90|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_24|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_15|, #length=|v_#length_105|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_28|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 788#[L115-6]don't care [625] L115-6-->L99-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= (store |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre13#1_Out_2|)) |v_#memory_int_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= v_~q~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~q~0.base_Out_2) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre13#1_Out_2|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (<= 0 v_~N~0_In_3) 1 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_3|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_In_3, ~q~0.base=v_~q~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ~q~0.offset=v_~q~0.offset_Out_2, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_5|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #memory_int, ~q~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~q~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] 790#[L99-3]don't care [481] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_4|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 822#[thread1ENTRY, L99-4]don't care [596] L99-4-->L100-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_25| 4) (select |v_#length_115| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_25|) (= (select |v_#valid_140| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_ULTIMATE.start_main_#t~pre15#1_21| |v_#pthreadsForks_28|) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_25| |v_ULTIMATE.start_main_#t~pre15#1_21|)))) InVars {#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_140|, #memory_int=|v_#memory_int_95|, #length=|v_#length_115|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_19|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_140|, #memory_int=|v_#memory_int_94|, #length=|v_#length_115|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] 760#[L100-3, thread1ENTRY]don't care [478] L100-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_12|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1] 764#[thread1ENTRY, L100-4, thread2ENTRY]don't care [499] thread2ENTRY-->L70-2: Formula: (= v_~s~0_8 0) InVars {} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_15|, ~s~0=v_~s~0_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~j~0#1, ~s~0] 778#[thread1ENTRY, L100-4, L70-2]don't care [2022-07-26 14:18:20,060 INFO L735 eck$LassoCheckResult]: Loop: 778#[thread1ENTRY, L100-4, L70-2]don't care [583] L70-2-->L70-2: Formula: (let ((.cse0 (* v_~q_front~0_57 4))) (let ((.cse1 (+ v_~q~0.offset_52 .cse0))) (and (= (select |v_#valid_120| v_~q~0.base_52) 1) (= (+ v_~q_front~0_57 1) v_~q_front~0_56) (= v_~y~0_25 (+ v_~y~0_26 v_~C~0_26)) (<= (+ v_~q~0.offset_52 .cse0 4) (select |v_#length_99| v_~q~0.base_52)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (and (< v_~q_front~0_57 v_~n~0_55) (< v_~q_front~0_57 v_~q_back~0_116) (<= 0 v_~q_front~0_57)) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (not (= |v_thread2Thread1of1ForFork0_~j~0#1_27| 0)) (= (select (select |v_#memory_int_84| v_~q~0.base_52) .cse1) |v_thread2Thread1of1ForFork0_~j~0#1_27|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (<= 0 .cse1) (= v_~s~0_28 (+ v_~s~0_29 |v_thread2Thread1of1ForFork0_~j~0#1_27|))))) InVars {~q_back~0=v_~q_back~0_116, ~C~0=v_~C~0_26, #valid=|v_#valid_120|, #memory_int=|v_#memory_int_84|, #length=|v_#length_99|, ~q~0.base=v_~q~0.base_52, ~y~0=v_~y~0_26, ~n~0=v_~n~0_55, ~q~0.offset=v_~q~0.offset_52, ~s~0=v_~s~0_29, ~q_front~0=v_~q_front~0_57} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_27|, ~q_back~0=v_~q_back~0_116, ~C~0=v_~C~0_26, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_11|, ~q~0.base=v_~q~0.base_52, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_11|, ~q~0.offset=v_~q~0.offset_52, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_120|, #memory_int=|v_#memory_int_84|, #length=|v_#length_99|, ~y~0=v_~y~0_25, ~n~0=v_~n~0_55, ~s~0=v_~s~0_28, ~q_front~0=v_~q_front~0_56} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, ~y~0, ~s~0, ~q_front~0] 778#[thread1ENTRY, L100-4, L70-2]don't care [2022-07-26 14:18:20,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:20,061 INFO L85 PathProgramCache]: Analyzing trace with hash 193352422, now seen corresponding path program 1 times [2022-07-26 14:18:20,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:18:20,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488012042] [2022-07-26 14:18:20,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:18:20,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:18:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:20,080 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:18:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:20,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:18:20,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:20,094 INFO L85 PathProgramCache]: Analyzing trace with hash 614, now seen corresponding path program 1 times [2022-07-26 14:18:20,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:18:20,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93797245] [2022-07-26 14:18:20,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:18:20,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:18:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:20,098 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:18:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:20,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:18:20,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:20,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1698958369, now seen corresponding path program 1 times [2022-07-26 14:18:20,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:18:20,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541555216] [2022-07-26 14:18:20,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:18:20,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:18:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:18:20,133 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-26 14:18:20,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:18:20,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541555216] [2022-07-26 14:18:20,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541555216] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:18:20,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:18:20,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-26 14:18:20,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452178899] [2022-07-26 14:18:20,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:18:20,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:18:20,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 14:18:20,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 14:18:20,241 INFO L87 Difference]: Start difference. First operand 42 states and 115 transitions. cyclomatic complexity: 88 Second operand has 3 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-26 14:18:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:18:20,264 INFO L93 Difference]: Finished difference Result 52 states and 129 transitions. [2022-07-26 14:18:20,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 129 transitions. [2022-07-26 14:18:20,265 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2022-07-26 14:18:20,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 47 states and 118 transitions. [2022-07-26 14:18:20,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-07-26 14:18:20,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-07-26 14:18:20,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 118 transitions. [2022-07-26 14:18:20,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:18:20,266 INFO L220 hiAutomatonCegarLoop]: Abstraction has 47 states and 118 transitions. [2022-07-26 14:18:20,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 118 transitions. [2022-07-26 14:18:20,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-07-26 14:18:20,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.5106382978723403) internal successors, (118), 46 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:18:20,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 118 transitions. [2022-07-26 14:18:20,270 INFO L242 hiAutomatonCegarLoop]: Abstraction has 47 states and 118 transitions. [2022-07-26 14:18:20,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 14:18:20,271 INFO L426 stractBuchiCegarLoop]: Abstraction has 47 states and 118 transitions. [2022-07-26 14:18:20,271 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-26 14:18:20,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 118 transitions. [2022-07-26 14:18:20,272 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2022-07-26 14:18:20,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:18:20,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:18:20,272 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:18:20,272 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:18:20,273 INFO L733 eck$LassoCheckResult]: Stem: 972#[ULTIMATE.startENTRY]don't care [632] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_7| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= 0 |v_#NULL.base_Out_2|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_1|) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_6|) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= v_~q_back~0_Out_6 v_~q_front~0_Out_6) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_2| 0) (= (select |v_#valid_In_7| 1) 1) (= 48 (select .cse1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~q~0.offset_Out_6 0) (= (select .cse1 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= v_~s~0_Out_6 0) (= v_~x~0_Out_2 0) (= 2 (select |v_#length_In_7| 1)) (< 0 |v_#StackHeapBarrier_In_1|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (= (select |v_#length_In_7| 2) 33) (= |v_#length_Out_2| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~y~0_Out_6 0) (= v_~q~0.base_Out_6 0)))) InVars {#memory_int=|v_#memory_int_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_6|, ~q_back~0=v_~q_back~0_Out_6, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~q~0.offset=v_~q~0.offset_Out_6, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_Out_2|, #length=|v_#length_Out_2|, ~y~0=v_~y~0_Out_6, ~q_front~0=v_~q_front~0_Out_6, ~s~0=v_~s~0_Out_6, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ~C~0=v_~C~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~q~0.base=v_~q~0.base_Out_6, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_6|, #memory_int=|v_#memory_int_In_7|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_Out_2|, ~n~0=v_~n~0_Out_2, ~x~0=v_~x~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~mem18#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~q~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~y~0, ~q_front~0, ~s~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~C~0, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_~#t1~0#1.base, ~q~0.base, 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, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] 932#[L115-6]don't care [586] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_25| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_28|) (<= 0 .cse0) (= (select |v_#valid_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (= (store |v_#memory_int_91| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_91| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_15|)) |v_#memory_int_90|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_25| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_24|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_105| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_91|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_15|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_25|, #length=|v_#length_105|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_28|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_90|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_24|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_15|, #length=|v_#length_105|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_28|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 934#[L115-6]don't care [625] L115-6-->L99-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= (store |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre13#1_Out_2|)) |v_#memory_int_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= v_~q~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~q~0.base_Out_2) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre13#1_Out_2|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (<= 0 v_~N~0_In_3) 1 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_3|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_In_3, ~q~0.base=v_~q~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ~q~0.offset=v_~q~0.offset_Out_2, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_5|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #memory_int, ~q~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~q~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] 936#[L99-3]don't care [481] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_4|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 974#[thread1ENTRY, L99-4]don't care [451] thread1ENTRY-->L49-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 910#[L49-5, L99-4]don't care [596] L99-4-->L100-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_25| 4) (select |v_#length_115| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_25|) (= (select |v_#valid_140| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_ULTIMATE.start_main_#t~pre15#1_21| |v_#pthreadsForks_28|) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_25| |v_ULTIMATE.start_main_#t~pre15#1_21|)))) InVars {#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_140|, #memory_int=|v_#memory_int_95|, #length=|v_#length_115|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_19|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_140|, #memory_int=|v_#memory_int_94|, #length=|v_#length_115|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] 912#[L100-3, L49-5]don't care [599] L49-5-->thread1EXIT: Formula: (let ((.cse1 (* v_~q_back~0_123 4))) (let ((.cse0 (+ .cse1 v_~q~0.offset_58))) (and (= (select |v_#valid_150| v_~q~0.base_58) 1) (<= 0 .cse0) (= v_~q_back~0_122 (+ v_~q_back~0_123 1)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13| (ite (= (select (select |v_#memory_int_102| v_~q~0.base_58) .cse0) 0) 1 0)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_9| 0) (not (< |v_thread1Thread1of1ForFork1_~i~0#1_25| v_~N~0_31)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0)) (<= (+ .cse1 v_~q~0.offset_58 4) (select |v_#length_125| v_~q~0.base_58)) (not (= (ite (and (<= 0 v_~q_back~0_123) (< v_~q_back~0_123 v_~n~0_61)) 1 0) 0)) (= v_~x~0_35 (+ v_~x~0_36 v_~C~0_34)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|) (= |v_thread1Thread1of1ForFork1_#res#1.base_9| 0)))) InVars {~q_back~0=v_~q_back~0_123, ~C~0=v_~C~0_34, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_25|, #valid=|v_#valid_150|, #memory_int=|v_#memory_int_102|, #length=|v_#length_125|, ~N~0=v_~N~0_31, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_61, ~x~0=v_~x~0_36, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_9|, ~q_back~0=v_~q_back~0_122, ~C~0=v_~C~0_34, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_9|, ~N~0=v_~N~0_31, ~q~0.base=v_~q~0.base_58, ~q~0.offset=v_~q~0.offset_58, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_25|, #valid=|v_#valid_150|, #memory_int=|v_#memory_int_102|, #length=|v_#length_125|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_9|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_9|, ~n~0=v_~n~0_61, ~x~0=v_~x~0_35, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, ~q_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 928#[L100-3, thread1EXIT]don't care [478] L100-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_12|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1] 930#[thread1EXIT, L100-4, thread2ENTRY]don't care [499] thread2ENTRY-->L70-2: Formula: (= v_~s~0_8 0) InVars {} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_15|, ~s~0=v_~s~0_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~j~0#1, ~s~0] 900#[thread1EXIT, L100-4, L70-2]don't care [2022-07-26 14:18:20,273 INFO L735 eck$LassoCheckResult]: Loop: 900#[thread1EXIT, L100-4, L70-2]don't care [583] L70-2-->L70-2: Formula: (let ((.cse0 (* v_~q_front~0_57 4))) (let ((.cse1 (+ v_~q~0.offset_52 .cse0))) (and (= (select |v_#valid_120| v_~q~0.base_52) 1) (= (+ v_~q_front~0_57 1) v_~q_front~0_56) (= v_~y~0_25 (+ v_~y~0_26 v_~C~0_26)) (<= (+ v_~q~0.offset_52 .cse0 4) (select |v_#length_99| v_~q~0.base_52)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (and (< v_~q_front~0_57 v_~n~0_55) (< v_~q_front~0_57 v_~q_back~0_116) (<= 0 v_~q_front~0_57)) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (not (= |v_thread2Thread1of1ForFork0_~j~0#1_27| 0)) (= (select (select |v_#memory_int_84| v_~q~0.base_52) .cse1) |v_thread2Thread1of1ForFork0_~j~0#1_27|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (<= 0 .cse1) (= v_~s~0_28 (+ v_~s~0_29 |v_thread2Thread1of1ForFork0_~j~0#1_27|))))) InVars {~q_back~0=v_~q_back~0_116, ~C~0=v_~C~0_26, #valid=|v_#valid_120|, #memory_int=|v_#memory_int_84|, #length=|v_#length_99|, ~q~0.base=v_~q~0.base_52, ~y~0=v_~y~0_26, ~n~0=v_~n~0_55, ~q~0.offset=v_~q~0.offset_52, ~s~0=v_~s~0_29, ~q_front~0=v_~q_front~0_57} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_27|, ~q_back~0=v_~q_back~0_116, ~C~0=v_~C~0_26, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_11|, ~q~0.base=v_~q~0.base_52, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_11|, ~q~0.offset=v_~q~0.offset_52, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_120|, #memory_int=|v_#memory_int_84|, #length=|v_#length_99|, ~y~0=v_~y~0_25, ~n~0=v_~n~0_55, ~s~0=v_~s~0_28, ~q_front~0=v_~q_front~0_56} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, ~y~0, ~s~0, ~q_front~0] 900#[thread1EXIT, L100-4, L70-2]don't care [2022-07-26 14:18:20,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:20,273 INFO L85 PathProgramCache]: Analyzing trace with hash 997800024, now seen corresponding path program 1 times [2022-07-26 14:18:20,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:18:20,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972752660] [2022-07-26 14:18:20,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:18:20,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:18:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:20,289 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:18:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:20,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:18:20,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:20,315 INFO L85 PathProgramCache]: Analyzing trace with hash 614, now seen corresponding path program 2 times [2022-07-26 14:18:20,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:18:20,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375799487] [2022-07-26 14:18:20,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:18:20,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:18:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:20,319 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:18:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:20,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:18:20,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:20,323 INFO L85 PathProgramCache]: Analyzing trace with hash 867030255, now seen corresponding path program 1 times [2022-07-26 14:18:20,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:18:20,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089425518] [2022-07-26 14:18:20,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:18:20,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:18:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:18:20,445 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-26 14:18:20,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:18:20,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089425518] [2022-07-26 14:18:20,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089425518] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-26 14:18:20,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517020112] [2022-07-26 14:18:20,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:18:20,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-26 14:18:20,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:20,448 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-26 14:18:20,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-07-26 14:18:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:18:20,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-26 14:18:20,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:18:20,637 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-26 14:18:20,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-26 14:18:20,687 INFO L356 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-07-26 14:18:20,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 15 [2022-07-26 14:18:20,757 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-26 14:18:20,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517020112] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-26 14:18:20,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-26 14:18:20,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 12 [2022-07-26 14:18:20,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162612020] [2022-07-26 14:18:20,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-26 14:18:20,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:18:20,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-26 14:18:20,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-26 14:18:20,866 INFO L87 Difference]: Start difference. First operand 47 states and 118 transitions. cyclomatic complexity: 84 Second operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:18:21,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:18:21,111 INFO L93 Difference]: Finished difference Result 129 states and 275 transitions. [2022-07-26 14:18:21,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 275 transitions. [2022-07-26 14:18:21,113 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2022-07-26 14:18:21,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 94 states and 206 transitions. [2022-07-26 14:18:21,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2022-07-26 14:18:21,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2022-07-26 14:18:21,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 206 transitions. [2022-07-26 14:18:21,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:18:21,115 INFO L220 hiAutomatonCegarLoop]: Abstraction has 94 states and 206 transitions. [2022-07-26 14:18:21,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 206 transitions. [2022-07-26 14:18:21,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2022-07-26 14:18:21,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 2.3506493506493507) internal successors, (181), 76 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:18:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 181 transitions. [2022-07-26 14:18:21,120 INFO L242 hiAutomatonCegarLoop]: Abstraction has 77 states and 181 transitions. [2022-07-26 14:18:21,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-26 14:18:21,121 INFO L426 stractBuchiCegarLoop]: Abstraction has 77 states and 181 transitions. [2022-07-26 14:18:21,121 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-26 14:18:21,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 181 transitions. [2022-07-26 14:18:21,122 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2022-07-26 14:18:21,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:18:21,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:18:21,127 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:18:21,127 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:18:21,128 INFO L733 eck$LassoCheckResult]: Stem: 1282#[ULTIMATE.startENTRY]don't care [632] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (select |v_#memory_int_In_7| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= 0 |v_#NULL.base_Out_2|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_1|) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_6|) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= v_~q_back~0_Out_6 v_~q_front~0_Out_6) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_2| 0) (= (select |v_#valid_In_7| 1) 1) (= 48 (select .cse1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~q~0.offset_Out_6 0) (= (select .cse1 1) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= v_~s~0_Out_6 0) (= v_~x~0_Out_2 0) (= 2 (select |v_#length_In_7| 1)) (< 0 |v_#StackHeapBarrier_In_1|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (= (select |v_#length_In_7| 2) 33) (= |v_#length_Out_2| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~y~0_Out_6 0) (= v_~q~0.base_Out_6 0)))) InVars {#memory_int=|v_#memory_int_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_6|, ~q_back~0=v_~q_back~0_Out_6, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~q~0.offset=v_~q~0.offset_Out_6, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_Out_2|, #length=|v_#length_Out_2|, ~y~0=v_~y~0_Out_6, ~q_front~0=v_~q_front~0_Out_6, ~s~0=v_~s~0_Out_6, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ~C~0=v_~C~0_Out_2, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~q~0.base=v_~q~0.base_Out_6, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_6|, #memory_int=|v_#memory_int_In_7|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_Out_2|, ~n~0=v_~n~0_Out_2, ~x~0=v_~x~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~mem18#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~q~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~y~0, ~q_front~0, ~s~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~C~0, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_~#t1~0#1.base, ~q~0.base, 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, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] 1238#[L115-6]don't care [586] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_25| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_28|) (<= 0 .cse0) (= (select |v_#valid_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (= (store |v_#memory_int_91| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_91| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_15|)) |v_#memory_int_90|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_25| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_24|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_105| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_91|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_15|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_25|, #length=|v_#length_105|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_28|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_90|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_24|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_15|, #length=|v_#length_105|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_28|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 1240#[L115-6]don't care [625] L115-6-->L99-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= (store |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre13#1_Out_2|)) |v_#memory_int_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= v_~q~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~q~0.base_Out_2) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre13#1_Out_2|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (<= 0 v_~N~0_In_3) 1 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_3|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_In_3, ~q~0.base=v_~q~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ~q~0.offset=v_~q~0.offset_Out_2, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_5|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #memory_int, ~q~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~q~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] 1242#[L99-3]don't care [481] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_4|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 1290#[thread1ENTRY, L99-4]don't care [451] thread1ENTRY-->L49-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 1336#[L49-5, L99-4]don't care [596] L99-4-->L100-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_25| 4) (select |v_#length_115| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_25|) (= (select |v_#valid_140| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_ULTIMATE.start_main_#t~pre15#1_21| |v_#pthreadsForks_28|) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_25| |v_ULTIMATE.start_main_#t~pre15#1_21|)))) InVars {#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_140|, #memory_int=|v_#memory_int_95|, #length=|v_#length_115|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_19|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_140|, #memory_int=|v_#memory_int_94|, #length=|v_#length_115|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] 1268#[L100-3, L49-5]don't care [601] L49-5-->L49-5: Formula: (let ((.cse0 (* v_~q_back~0_127 4))) (let ((.cse1 (+ v_~q~0.offset_60 .cse0))) (and (<= (+ v_~q~0.offset_60 .cse0 4) (select |v_#length_127| v_~q~0.base_60)) (< |v_thread1Thread1of1ForFork1_~i~0#1_28| v_~N~0_35) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15| (ite (= (select (select |v_#memory_int_104| v_~q~0.base_60) .cse1) 1) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_28| 1) |v_thread1Thread1of1ForFork1_~i~0#1_27|) (<= 0 .cse1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|) (= (select |v_#valid_152| v_~q~0.base_60) 1) (not (= (ite (and (< v_~q_back~0_127 v_~n~0_63) (<= 0 v_~q_back~0_127)) 1 0) 0)) (= v_~x~0_39 (+ v_~x~0_40 v_~C~0_36)) (= (+ v_~q_back~0_127 1) v_~q_back~0_126) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))))) InVars {~q_back~0=v_~q_back~0_127, ~C~0=v_~C~0_36, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_28|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_104|, #length=|v_#length_127|, ~N~0=v_~N~0_35, ~q~0.base=v_~q~0.base_60, ~n~0=v_~n~0_63, ~x~0=v_~x~0_40, ~q~0.offset=v_~q~0.offset_60} OutVars{~q_back~0=v_~q_back~0_126, ~C~0=v_~C~0_36, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_7|, ~N~0=v_~N~0_35, ~q~0.base=v_~q~0.base_60, ~q~0.offset=v_~q~0.offset_60, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_19|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_7|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_27|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_104|, #length=|v_#length_127|, ~n~0=v_~n~0_63, ~x~0=v_~x~0_39, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 1270#[L100-3, L49-5]don't care [478] L100-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_12|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1] 1266#[L49-5, L100-4, thread2ENTRY]don't care [499] thread2ENTRY-->L70-2: Formula: (= v_~s~0_8 0) InVars {} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_15|, ~s~0=v_~s~0_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~j~0#1, ~s~0] 1256#[L49-5, L100-4, L70-2]don't care [2022-07-26 14:18:21,128 INFO L735 eck$LassoCheckResult]: Loop: 1256#[L49-5, L100-4, L70-2]don't care [583] L70-2-->L70-2: Formula: (let ((.cse0 (* v_~q_front~0_57 4))) (let ((.cse1 (+ v_~q~0.offset_52 .cse0))) (and (= (select |v_#valid_120| v_~q~0.base_52) 1) (= (+ v_~q_front~0_57 1) v_~q_front~0_56) (= v_~y~0_25 (+ v_~y~0_26 v_~C~0_26)) (<= (+ v_~q~0.offset_52 .cse0 4) (select |v_#length_99| v_~q~0.base_52)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (and (< v_~q_front~0_57 v_~n~0_55) (< v_~q_front~0_57 v_~q_back~0_116) (<= 0 v_~q_front~0_57)) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (not (= |v_thread2Thread1of1ForFork0_~j~0#1_27| 0)) (= (select (select |v_#memory_int_84| v_~q~0.base_52) .cse1) |v_thread2Thread1of1ForFork0_~j~0#1_27|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (<= 0 .cse1) (= v_~s~0_28 (+ v_~s~0_29 |v_thread2Thread1of1ForFork0_~j~0#1_27|))))) InVars {~q_back~0=v_~q_back~0_116, ~C~0=v_~C~0_26, #valid=|v_#valid_120|, #memory_int=|v_#memory_int_84|, #length=|v_#length_99|, ~q~0.base=v_~q~0.base_52, ~y~0=v_~y~0_26, ~n~0=v_~n~0_55, ~q~0.offset=v_~q~0.offset_52, ~s~0=v_~s~0_29, ~q_front~0=v_~q_front~0_57} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_27|, ~q_back~0=v_~q_back~0_116, ~C~0=v_~C~0_26, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_11|, ~q~0.base=v_~q~0.base_52, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_11|, ~q~0.offset=v_~q~0.offset_52, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_120|, #memory_int=|v_#memory_int_84|, #length=|v_#length_99|, ~y~0=v_~y~0_25, ~n~0=v_~n~0_55, ~s~0=v_~s~0_28, ~q_front~0=v_~q_front~0_56} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, ~y~0, ~s~0, ~q_front~0] 1256#[L49-5, L100-4, L70-2]don't care [2022-07-26 14:18:21,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:21,128 INFO L85 PathProgramCache]: Analyzing trace with hash 997801946, now seen corresponding path program 1 times [2022-07-26 14:18:21,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:18:21,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216131407] [2022-07-26 14:18:21,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:18:21,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:18:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:21,151 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:18:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:21,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:18:21,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:21,182 INFO L85 PathProgramCache]: Analyzing trace with hash 614, now seen corresponding path program 3 times [2022-07-26 14:18:21,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:18:21,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811672079] [2022-07-26 14:18:21,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:18:21,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:18:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:21,186 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:18:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:21,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:18:21,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:21,193 INFO L85 PathProgramCache]: Analyzing trace with hash 867089837, now seen corresponding path program 1 times [2022-07-26 14:18:21,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:18:21,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007123393] [2022-07-26 14:18:21,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:18:21,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:18:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:21,237 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:18:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:21,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:18:21,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:22,412 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:18:22,412 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:18:22,412 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:18:22,412 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:18:22,412 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:18:22,412 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:22,412 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:18:22,412 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:18:22,412 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-queue-add-2-nl.wvr.c_BEv2_Iteration6_Lasso [2022-07-26 14:18:22,412 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:18:22,412 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:18:22,416 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:22,417 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:22,419 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:22,421 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:22,422 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:22,426 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:22,428 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,119 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,121 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,122 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,124 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,127 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,131 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,132 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,136 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,137 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,141 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,143 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,144 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,146 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,148 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,149 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,151 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,153 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,154 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,157 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,159 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,160 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,162 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,163 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,165 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,166 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,168 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,170 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,171 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,173 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,174 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,176 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,178 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,180 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,181 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,183 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,184 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:18:23,738 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:18:23,739 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:18:23,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:23,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:23,744 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-26 14:18:23,745 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-26 14:18:23,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:23,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:23,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:23,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:23,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:23,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:23,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:23,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:23,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:23,770 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-26 14:18:23,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:23,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:23,771 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-26 14:18:23,772 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-26 14:18:23,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:23,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:23,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:23,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:23,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:23,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:23,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:23,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:23,781 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:23,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-07-26 14:18:23,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:23,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:23,796 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-26 14:18:23,796 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-26 14:18:23,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:23,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:23,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:23,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:23,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:23,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:23,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:23,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:23,804 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:23,820 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-26 14:18:23,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:23,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:23,821 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-26 14:18:23,821 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-26 14:18:23,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:23,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:23,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:23,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:23,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:23,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:23,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:23,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:23,829 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:23,843 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-26 14:18:23,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:23,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:23,844 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-26 14:18:23,845 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-26 14:18:23,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:23,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:23,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:23,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:23,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:23,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:23,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:23,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:23,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:23,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:23,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:23,883 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-26 14:18:23,884 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-26 14:18:23,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-26 14:18:23,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:23,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:18:23,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:23,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:23,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:23,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:18:23,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:18:23,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:23,906 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-26 14:18:23,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:23,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:23,907 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-26 14:18:23,907 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-26 14:18:23,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:23,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:23,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:23,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:23,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:23,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:23,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:23,917 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:23,931 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-26 14:18:23,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:23,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:23,932 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-26 14:18:23,933 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-26 14:18:23,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:23,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:23,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:23,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:23,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:23,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:23,943 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:23,951 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:23,968 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-26 14:18:23,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:23,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:23,969 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-26 14:18:23,970 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-26 14:18:23,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:23,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:23,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:23,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:23,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:23,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:23,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:23,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:24,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:24,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:24,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:24,021 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-26 14:18:24,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:24,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:24,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:24,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:24,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:24,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:24,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:24,038 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-26 14:18:24,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:24,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:24,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:24,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:24,064 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-26 14:18:24,065 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-26 14:18:24,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:24,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:24,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:24,072 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-26 14:18:24,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:24,081 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-26 14:18:24,081 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-26 14:18:24,103 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:24,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-07-26 14:18:24,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:24,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:24,120 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-26 14:18:24,120 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-26 14:18:24,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:24,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:24,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:24,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:24,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:24,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:24,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:24,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:24,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:24,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:24,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:24,147 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-26 14:18:24,147 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-26 14:18:24,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:24,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:24,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:24,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:24,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:24,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:24,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:24,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:24,171 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-26 14:18:24,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:24,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:24,172 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-26 14:18:24,173 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-26 14:18:24,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:24,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:24,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:24,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:24,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:24,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:24,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:24,182 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:24,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:24,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:24,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:24,198 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-26 14:18:24,199 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-26 14:18:24,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:24,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:24,206 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-26 14:18:24,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:24,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:24,214 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-26 14:18:24,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:24,226 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:24,241 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-26 14:18:24,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:24,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:24,242 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-26 14:18:24,244 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-26 14:18:24,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:24,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:24,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:24,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:24,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:24,251 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:24,251 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:24,254 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:24,269 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-26 14:18:24,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:24,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:24,275 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-26 14:18:24,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:24,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:24,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:24,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:24,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:24,284 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:24,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:24,287 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-26 14:18:24,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:24,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-07-26 14:18:24,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:24,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:24,305 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-26 14:18:24,306 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-26 14:18:24,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:24,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:24,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:24,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:24,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:24,314 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:24,314 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:24,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:24,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:24,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:24,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:24,331 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-26 14:18:24,332 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-26 14:18:24,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:24,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:24,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:24,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:24,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:24,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:24,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:24,345 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:18:24,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2022-07-26 14:18:24,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:24,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:24,360 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-26 14:18:24,361 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-26 14:18:24,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:18:24,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:18:24,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:18:24,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:18:24,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:18:24,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:18:24,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:18:24,391 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:18:24,416 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-26 14:18:24,416 INFO L444 ModelExtractionUtils]: 7 out of 43 variables were initially zero. Simplification set additionally 32 variables to zero. [2022-07-26 14:18:24,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:24,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:24,418 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-26 14:18:24,418 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-26 14:18:24,419 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:18:24,425 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:18:24,425 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:18:24,425 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q~0.offset, v_rep(select #length ~q~0.base)_2, ~q_front~0) = -1*~q~0.offset + 1*v_rep(select #length ~q~0.base)_2 - 2*~q_front~0 Supporting invariants [] [2022-07-26 14:18:24,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2022-07-26 14:18:24,533 INFO L156 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2022-07-26 14:18:24,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:18:24,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:18:24,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:18:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:18:24,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-26 14:18:24,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:18:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:18:24,599 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:18:24,599 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 181 transitions. cyclomatic complexity: 119 Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:18:24,638 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 181 transitions. cyclomatic complexity: 119. Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 139 states and 326 transitions. Complement of second has 4 states. [2022-07-26 14:18:24,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:18:24,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:18:24,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-07-26 14:18:24,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 9 letters. Loop has 1 letters. [2022-07-26 14:18:24,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:18:24,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 10 letters. Loop has 1 letters. [2022-07-26 14:18:24,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:18:24,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-26 14:18:24,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:18:24,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 326 transitions. [2022-07-26 14:18:24,642 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 14:18:24,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 0 states and 0 transitions. [2022-07-26 14:18:24,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-26 14:18:24,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-26 14:18:24,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-26 14:18:24,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:18:24,642 INFO L220 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:18:24,642 INFO L242 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:18:24,642 INFO L426 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:18:24,642 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-26 14:18:24,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-26 14:18:24,642 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 14:18:24,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-26 14:18:24,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 02:18:24 BoogieIcfgContainer [2022-07-26 14:18:24,648 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 14:18:24,649 INFO L158 Benchmark]: Toolchain (without parser) took 17697.87ms. Allocated memory was 176.2MB in the beginning and 346.0MB in the end (delta: 169.9MB). Free memory was 116.3MB in the beginning and 152.3MB in the end (delta: -36.0MB). Peak memory consumption was 134.4MB. Max. memory is 8.0GB. [2022-07-26 14:18:24,649 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 176.2MB. Free memory is still 132.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 14:18:24,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.15ms. Allocated memory was 176.2MB in the beginning and 240.1MB in the end (delta: 64.0MB). Free memory was 116.2MB in the beginning and 209.9MB in the end (delta: -93.7MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-07-26 14:18:24,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.99ms. Allocated memory is still 240.1MB. Free memory was 209.9MB in the beginning and 207.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 14:18:24,650 INFO L158 Benchmark]: Boogie Preprocessor took 25.75ms. Allocated memory is still 240.1MB. Free memory was 207.8MB in the beginning and 206.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 14:18:24,650 INFO L158 Benchmark]: RCFGBuilder took 597.77ms. Allocated memory is still 240.1MB. Free memory was 206.2MB in the beginning and 183.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-07-26 14:18:24,651 INFO L158 Benchmark]: BuchiAutomizer took 16766.94ms. Allocated memory was 240.1MB in the beginning and 346.0MB in the end (delta: 105.9MB). Free memory was 183.1MB in the beginning and 152.3MB in the end (delta: 30.8MB). Peak memory consumption was 137.2MB. Max. memory is 8.0GB. [2022-07-26 14:18:24,652 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.11ms. Allocated memory is still 176.2MB. Free memory is still 132.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 266.15ms. Allocated memory was 176.2MB in the beginning and 240.1MB in the end (delta: 64.0MB). Free memory was 116.2MB in the beginning and 209.9MB in the end (delta: -93.7MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.99ms. Allocated memory is still 240.1MB. Free memory was 209.9MB in the beginning and 207.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.75ms. Allocated memory is still 240.1MB. Free memory was 207.8MB in the beginning and 206.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 597.77ms. Allocated memory is still 240.1MB. Free memory was 206.2MB in the beginning and 183.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * BuchiAutomizer took 16766.94ms. Allocated memory was 240.1MB in the beginning and 346.0MB in the end (delta: 105.9MB). Free memory was 183.1MB in the beginning and 152.3MB in the end (delta: 30.8MB). Peak memory consumption was 137.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + unknown-#length-unknown[arr] and consists of 4 locations. One deterministic module has affine ranking function n + -1 * q_back and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[q] + -2 * q_front + -1 * q and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.6s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 11.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 32 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 126 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 124 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 304 IncrementalHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 7 mSDtfsCounter, 304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital294 mio100 ax108 hnf100 lsp77 ukn77 mio100 lsp42 div124 bol100 ite100 ukn100 eq170 hnf92 smp81 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 39ms VariablesStem: 4 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 4.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 134 PlacesBefore, 21 PlacesAfterwards, 138 TransitionsBefore, 17 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 8 FixpointIterations, 97 TrivialSequentialCompositions, 23 ConcurrentSequentialCompositions, 14 TrivialYvCompositions, 7 ConcurrentYvCompositions, 8 ChoiceCompositions, 149 TotalNumberOfCompositions, 833 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 727, positive: 703, positive conditional: 0, positive unconditional: 703, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 393, positive: 384, positive conditional: 0, positive unconditional: 384, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 727, positive: 319, positive conditional: 0, positive unconditional: 319, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 393, unknown conditional: 0, unknown unconditional: 393] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 RESULT: Ultimate proved your program to be correct! [2022-07-26 14:18:24,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-07-26 14:18:24,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-07-26 14:18:25,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...